**Computability Theory**

by Wilfried Sieg

**Publisher**: Carnegie Mellon University 2006**Number of pages**: 125

**Description**:

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 mathematical theory that is to reflect parts of our physical or intellectual experience.

Download or read it online for free here:

**Download link**

(multiple formats)

## Similar books

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

(

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

(

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

(

**15657**views)

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

(

**6751**views)