Ratings by cpressey of Theory of Computation works
Computation: Finite and Infinite Machines
The Universal Turing Machine
Theory of Recursive Functions and Effective Computability
Automata and Computability
Theory of Computation
Theories of Computation
Computability Theory, Semantics, and Logic Programming
Theory of Deductive Systems and its Applications
Handbook of Theoretical Computer Science
Why is the Turing machine considered effective computation if it's not realizable due to the Bekenstein bound?
Other Undecidable Problems (wayback)
Scooping the Loop Snooper --- Geoffrey K. Pullum
Shtetl-Optimized » Blog Archive » Rosser's Theorem via Turing machines
Are there any undecidability results that are not known to have a diagonal argument proof?
Is there a finite-dimensional vector space whose dimension cannot be found?
The Limits of Reason (Gregory Chaitin)