5 votes

How Dr. Seuss would prove the halting problem undecidable

Posted by DougM
Tags: computer science
https://ebiquity.umbc.edu/blogger/2008/01/19/how-dr-suess-would-prove-the-halting-problem-undecidable/

Link information

This data is scraped automatically and may be incorrect.

Authors
UMBC ebiquity
Published
Jan 19 2008
Word count
309 words