Introduction to Computability Theory
by Dag Normann
Publisher: The University of Oslo 2010
Number of pages: 95
Description:
This text is essentially consisting of two parts, Classical Computability Theory and Generalized Computability Theory. We will assume that the reader is familiar with the standard vocabulary of logic and set theory, but no advanced background from logic is required.
Download or read it online for free here:
Download link
(430KB, PDF)
Similar books
Recursion Theoryby 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.
(10726 views)
Computability Theoryby 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.
(8052 views)
Prolog Experiments in Discrete Mathematics, Logic, and Computabilityby 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.
(21086 views)
Computability 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.
(10016 views)