This seems inspired by Cantor's infinity proof. I've seen a halting problem proof via Cantor's diagonal as well...
Are there any other significant proofs that use a similar methodology? Why does Cantor's method work well here? ...algorithms / programs are countably infinite, no?
(Finding this more interesting now than I did in school!)