Any examples of programs which, as of our understanding today, have roughly 1:1 odds of halting? (No random numbers allowed duh)
-
My goal was to ask if the frontier of humanity's knowledge search is likely to produce "undecidable"s or just "hard"s
Halting problem uses a trivial construction of undecidability. My intuition is that "nontrivially undecidable" does not exist
-
-
(Substitute a sufficiently rich definition of "nontrivially" that it doesn't feel like gaming or talking about fluidity of concepts woo)
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
The Arithmetic Hierarchy gives an infinite hierarchy of classes of undecidability harder than halting. Are all 'trivial'?
-
no, not "trivial". But, "contrived"? Not increasing the risk that I will stumble upon an undecidable problem by chance?
- 8 more replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.