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.
(8296 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.
(8296 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.
(5718 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.
(5718 views)
Introduction to Computability Theory
by Dag Normann - 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.
(2721 views)
by Dag Normann - 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.
(2721 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.
(1524 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.
(1524 views)