People confuse programming with coding.
People confuse programming with coding
Ian Jackson
Easton Martinez
sounds based to me
Jayden Perez
Why do theorytards frame every problem as a decision problem (a "yes or no" problem)?
>Is it decidable (yes or no) in X time?
>Does the language accept the input (yes or no)?
>Does the routine return (yes or no)?
>>but what if I want to know WHAT it decides ON? what if i want to know the CAPTURE GROUPS? what if i want to know WHAT the routine returns?
>oh it's "easy," just turn it into a brute-force decision problem that takes fifty million years to run
Math is a fucking meme.
Aiden Wilson
semantics
Hudson Roberts
You're just retarded and unable to RTFM. Basic ass research answers your question and shows how mentally unfit you are even be in the vicinity of a computer, let alone operate one.
Evan Ortiz
I'm not asking for "an" answer, I'm asking for a BETTER answer, because the canonical answer, determined by exactly the research you're talking about and parroted tirelessly by professors everywhere, is:
>>oh it's "easy," just turn it into a brute-force decision problem that takes fifty million years to run
Benjamin Johnson
>an algorithm without proof is just a conjecture
Yeah so?
Maths is full of conjectures, nobody has time to prove all this shit.
I'd never finish anything if I had to prove every algorithm I write.
Thomas Gonzalez
>Yeah so?
>Maths is full of conjectures, nobody has time to prove all this shit.
>I'd never finish anything if I had to prove every algorithm I write.
Jayden Butler
The idea behind decision problems is that you are able to determine not only how quickly an algorithm runs, but how it runs and what it returns which is very useful because some problem that might initially seem esoteric and unsolvable, if it can be reduced to a decision problem, can be simplified and we can assure that given certain inputs, it will return some set of results in X amount of time. Usually these are optimization type problems where you typically want it in the least amount of time/cost/enery/etc. but it can apply to other branches. Mostly though they are used to ensure an algorithm runs within a generally small amount of time and returns a correct (or within a small error margin of correct if there is some leeway) result.
Ryder Diaz
holy based