Halting
Jump to navigation
Jump to search
halting |
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]
Explanation[edit]
This explanation is either missing or incomplete. |
Transcript[edit]
This transcript was generated by a bot: The text was scraped using AWS's Textract, which may have errors. Complete transcripts describe what happens in each panel — here are some good examples to get you started (1) (2). |
- [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]
This transcript was generated by a bot: The text was scraped using AWS's Textract, which may have errors. Complete transcripts describe what happens in each panel — here are some good examples to get you started (1) (2). |
- [Describe panel here]
- But what happens if you try to make the program beat *itself* with a stick?
- If
- S
add a comment! ⋅ add a topic (use sparingly)! ⋅ refresh comments!
Discussion
No comments yet!