The Hilbert Hotel – Opinionator Blog – NYTimes.com

The Hilbert Hotel – Opinionator Blog – NYTimes.com

May 10

Link: The Hilbert Hotel – Opinionator Blog – NYTimes.com

This is a good read.

In a class I took with my thesis advisor, he explained the Hilbert Hotel similarly, and it was as entertaining then as this is now.

How Dr. Seuss would prove the halting problem undecidable

How Dr. Seuss would prove the halting problem undecidable

May 05

Link: How Dr. Seuss would prove the halting problem undecidable

This is a hoot!

The halting problem is described on Wikipedia as:

Given a description of a program, decide whether the program finishes running or will run forever.

The halting problem is algorithmically undecidable because “there is no algorithm which can be applied to any arbitrary program and input to decide whether the program stops when run with that input.”