Logo

Computability, Unsolvability, Randomness

Computability, Unsolvability, Randomness
by

Publisher: The Pennsylvania State University
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.

Home page url

Download or read it online for free here:
Download link
(910KB, PDF)

Similar books

Book cover: Introduction to Computability TheoryIntroduction to Computability Theory
by - The University of Oslo
This text is consisting of two parts, Classical Computability Theory and Generalized Computability Theory. We assume that the reader is familiar with the standard vocabulary of logic and set theory, but no advanced background from logic is required.
(5495 views)
Book cover: Computability TheoryComputability Theory
by - 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.
(7564 views)
Book cover: Computability and ComplexityComputability 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.
(9168 views)
Book cover: Recursion TheoryRecursion Theory
by - 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.
(10139 views)