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.
(5237 views)
Book cover: Prolog Experiments in Discrete Mathematics, Logic, and ComputabilityProlog Experiments in Discrete Mathematics, Logic, and Computability
by - 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.
(19890 views)
Book cover: Computability and Complexity from a Programming PerspectiveComputability and Complexity from a Programming Perspective
by - 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.
(11598 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.
(9870 views)