4 ms·
they never ran the program they claimed couldn’t exist ?? Also, why directly run the programs? What about running them with a wrapper program that crashes em i
by bionhoward 2y ago
they never ran the program they claimed couldn’t exist ??
Also, why directly run the programs? What about running them with a wrapper program that crashes em if they invert the output of their input?
All this undecidability stuff reads like regurgitated hokum to justify giving up on a problem just because a single oversimplified case can’t be solved for all pathological inputs in a particular way (without bothering to look for a workaround)
- Tainnor 2y agoI don't at all understand where your confusion lies, but be assured that undecidability/noncomputability isn't "hokum". It's probably "regurgitated" in the sense that this is covered in about every "intro CS" textbook, lecture, etc. because it forms the basis of theoretical CS.