eh, it's a bad question. Gameable
Any examples of programs which, as of our understanding today, have roughly 1:1 odds of halting? (No random numbers allowed duh)
-
-
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
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
- 1 more reply
New conversation -
-
-
Trivial to construct with the Prime Number Theorem, a little algebra, and a while-True loop.
-
(Primality of large numbers is essentially pseudo-random wrt computational limitations.)
- 1 more reply
New conversation -
-
-
A program that halts iff the 3^^^3rd digit of pi is < 5. (pi's not random)
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
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.