**Computability and Randomness**

by Andre Nies

**Publisher**: Oxford University Press 2008**ISBN/ASIN**: 0199230765**ISBN-13**: 9780199230761**Number of pages**: 447

**Description**:

Covering the basics as well as recent research results, this book provides a very readable introduction to the exciting interface of computability and randomness for graduates and researchers in computability theory, theoretical computer science, and measure theory.

Download or read it online for free here:

**Download link**

(2.6MB, PDF)

## Similar books

**Recursion Theory**

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.

(

**10143**views)

**Computability, Unsolvability, Randomness**

by

**Stephen G. Simpson**-

**The Pennsylvania State University**

I exposit Turing's theory of computability and unsolvability, as subsequently developed by Kleene and Post. Second, I provide an introductory account of a research area which is currently very active: algorithmic randomness and Kolmogorov complexity.

(

**4809**views)

**Computability Theory**

by

**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.

(

**7570**views)

**Introduction to Computability Theory**

by

**Dag Normann**-

**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.

(

**5500**views)