Computability, Unsolvability, Randomness

Computability, Unsolvability, Randomness


Publisher: The Pennsylvania State University
Number of pages: 151

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 and in the study of unsolvable mathematical problems. Second, I provide an introductory account of a 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)

You might also like
Leave A Reply