Computability, Unsolvability, Randomness
by Stephen G. Simpson
Publisher: The Pennsylvania State University 2009
Number of pages: 151
Description:
I exposit Turing's 1936 theory of computability and unsolvability, as subsequently developed by Kleene and Post. This theory is of the essence in theoretical computer science and in the study of unsolvable mathematical problems. Second, I provide an introductory account of a research area which is currently very active: algorithmic randomness and Kolmogorov complexity.
Download or read it online for free here:
Download link
(910KB, PDF)
Similar books

- Wikibooks
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.
(6045 views)

by Frank Stephan - National University of Singapore
Recursion theory deals with the fundamental concepts on what subsets of natural numbers could be defined effectively and how complex the so defined sets are. This text gives an overview on the basic results and proof methods in recursion theory.
(7504 views)

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.
(8615 views)

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.
(16824 views)