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)
End of conversation
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.