@Plinz A bit of philosophical question, but why do you think the halting problem is undecidable? What is it about computation that makes some problems provably unsolvable?
Replying to @FieryPhoenix7
Proving means to losslessly compress a statement to a set of axioms. For an undecidable statement, the compression algorithm does not terminate.
10:48 AM - 12 Dec 2018
from North Cambridge, Cambridge
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.