When I TA'd computability & complexity as a graduate student, I always loved giving this proof of Godel's Theorem as an easy corollary of the Halting Problem as a homework assignment.
It's beautiful, elegant, and easy to understand. I was introduced to the proof by a note in Sipser's text.
It's beautiful, elegant, and easy to understand. I was introduced to the proof by a note in Sipser's text.