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
Computability and Complexity- 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.
(4680 views)
Computability and Randomnessby 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.
(7440 views)
Prolog Experiments in Discrete Mathematics, Logic, and Computabilityby 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.
(14813 views)
Computability Theoryby Wilfried Sieg - Carnegie Mellon University
Computability is the basic theoretical concept for computer science, artificial intelligence and cognitive science. This essay discusses, at its heart, methodological issues that are central to any theory that is to reflect parts of our experience.
(3529 views)