Introduction to Computability Theory
by Dag Normann
Publisher: The University of Oslo 2010
Number of pages: 95
This text is essentially consisting of two parts, Classical Computability Theory and Generalized Computability Theory. We will assume that the reader is familiar with the standard vocabulary of logic and set theory, but no advanced background from logic is required.
Download or read it online for free here:
by James Hein - Portland State University
Programming experiments designed to help learning of discrete mathematics, logic, and computability. Most of the experiments are short and to the point, just like traditional homework problems, so that they reflect the daily classroom work.
by Neil D. Jones - The MIT Press
The author builds a bridge between computability and complexity theory and other areas of computer science. Jones uses concepts familiar from programming languages to make computability and complexity more accessible to computer scientists.
This book is intended as an introductory textbook in Computability Theory and Complexity Theory, with an emphasis on Formal Languages. Its target audience is CS and Math students with some background in programming and data structures.
by Andre Nies - Oxford University Press
Covering the basics as well as recent research results, this book provides an introduction to the interface of computability and randomness for graduates and researchers in computability theory, theoretical computer science, and measure theory.