Halting

From SMBC Wiki
Jump to navigation Jump to search
halting
You can also solve the Goldbach Conjecture, for the special case of only considering numbers arising before you beat the machine with a stick.
Title text: You can also solve the Goldbach Conjecture, for the special case of only considering numbers arising before you beat the machine with a stick.

Votey[edit]

154869385020190128after.png


Explanation[edit]

Ambox notice.png This explanation is either missing or incomplete.

Transcript[edit]

Ambox notice.png This transcript was generated by a bot: The text was scraped using AWS's Textract, which may have errors. Complete transcripts should also describe what happens in each panel.
[Describe panel here]
The halting problem is easy to solve. If the program runs too long, I take this stick and beat the computer until it stops.
0
o
o
Caption: What if Alan Turing had been an engineer?

Votey Transcript[edit]

Ambox notice.png This transcript was generated by a bot: The text was scraped using AWS's Textract, which may have errors. Complete transcripts should also describe what happens in each panel.
[Describe panel here]
But what happens if you try to make the program beat *itself* with a stick?
If
S

Comment.png add a comment! ⋅ Comment.png add a topic (use sparingly)! ⋅ Icons-mini-action refresh blue.gif refresh comments!

Discussion

No comments yet!