Charles Petzold's book The Annotated Turing, which covers Turing's 1936 paper on computable numbers and much of the background material needed to understand it, is more than decent. As a result, I was ...

Computational complexity and computability are central themes in theoretical computer science that address the fundamental question of what can be computed and at what cost. Computability theory ...