Teaching myself a little CS, have a question: OK, so Turing proves there's no general way to decide in advance if any program halts. (do I have that right?) But the program he describes seems like a really weird one. Are most "normal" programs under, say 1M lines easy to decide?
-
-
This Tweet is unavailable.
-
This Tweet is unavailable.
Replying to @evanburchard @ZachWeiner
Indeed - I don't know of any "normal" program that doesn't either halt or make progress (e.g. a server doesn't halt but keeps delivering results), but getting a machine to decide that for a program that wasn't written with that in mind is a different matter entirely...
2:15 PM - 7 Jan 2019
0 replies
0 retweets
1 like
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.