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

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

(

**20227**views)

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

(

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

(

**5475**views)

**Computability and Complexity from a Programming Perspective**

by

**Neil D. Jones**-

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

(

**11956**views)