Computability and complexity theory should be of central concern to practitioners as well as theorists. Unfortunately, however, the field is known for its impen

George Boolos was one of the most prominent and influential logician-philosophers of recent times. This collection, nearly all chosen by Boolos himself shortly

These are my lecture notes from CS381/481: Automata and Computability Theory, a one-semester senior-level course I have taught at Cornell Uni versity for many y

This fifth edition of 'Computability and Logic' covers not just the staple topics of an intermediate logic course such as Godel's incompleteness theorems, but a

Turing's famous 1936 paper introduced a formal definition of a computing machine, a Turing machine. This model led to both the development of actual computers a