UMBC Ebiquity Lab Blog company blog
How Dr. Seuss would prove the halting problem undecidable
The original page did not respond normally when we last checked (HTTP 403). The archived copy may help.
- Points
- 249
- HN comments
- 60
- Submissions
- 2
- Cited by
- 0 commenters
Math & AlgorithmsSoftware Engineering2010
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| May 5, 2010 | How Dr. Seuss would prove the halting problem undecidable by raganwald | 249 | 52 |
| Dec 25, 2015 | How Dr. Seuss would prove the halting problem undecidable (2008) by amelius | 99 | 8 |
