**Recursion Theory**

by Frank Stephan

**Publisher**: National University of Singapore 2009**Number of pages**: 125

**Description**:

Recursion theory deals with the fundamental concepts on what subsets of natural numbers (or other famous countable domains) 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.

Download or read it online for free here:

**Download link**

(610KB, PDF)

## Similar books

**Computability and Randomness**

by

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

(

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

(

**4174**views)

**Prolog Experiments in Discrete Mathematics, Logic, and Computability**

by

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

(

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

(

**6984**views)