Any examples of programs which, as of our understanding today, have roughly 1:1 odds of halting? (No random numbers allowed duh)
-
I'm not familiar enough with group theory or topology to comment on those. Among the rest, it seems to break down into 2 forms
1. Instantiate the halting problem in X. (trivial) 2. X produces pseudorandom behavior which can't be predicted. (maybe not)
-
-
I think I'd be satisfied with 2 if X is of substantial consequence elsewhere in the field
-
X could be e.g. P=NP
- 2 more replies
New conversation -
-
-
Instantiating the halting prob. can be how you *prove* undecidability in probs of interest for other reasons; I've seen that.
-
in those cases I always feel let down because the halting problem usually isn't a "pragmatic" usage of a system
- 9 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.