Logo

Recursion Theory by Frank Stephan

Small book cover: Recursion Theory

Recursion Theory
by

Publisher: National University of Singapore
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

Book cover: Computability and ComplexityComputability and Complexity
- Wikibooks
This book is intended as an introductory textbook in Computability Theory and Complexity Theory, with an emphasis on Formal Languages. Its target audience is CS and Math students with some background in programming and data structures.
(5701 views)
Book cover: Computability and Complexity from a Programming PerspectiveComputability and Complexity from a Programming Perspective
by - 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.
(8277 views)
Book cover: Computability and RandomnessComputability and Randomness
by - 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.
(8506 views)
Book cover: Computability, Unsolvability, RandomnessComputability, Unsolvability, Randomness
by - 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.
(1499 views)