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.

Home page url

Download or read it online for free here:
Download link
(610KB, PDF)

Similar books

Book cover: Introduction to Computability TheoryIntroduction to Computability Theory
by - 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.
(970 views)
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.
(4039 views)
Book cover: Computability TheoryComputability Theory
by - 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.
(2918 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.
(6790 views)