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
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.
(11727 views)
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.
(11727 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.
(4637 views)
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.
(4637 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.
(20034 views)
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.
(20034 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.
(8917 views)
- 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.
(8917 views)