Computability and Randomness
by Andre Nies
Publisher: Oxford University Press 2008
ISBN/ASIN: 0199230765
ISBN-13: 9780199230761
Number of pages: 447
Description:
Covering the basics as well as recent research results, this book provides a very readable introduction to the exciting interface of computability and randomness for graduates and researchers in computability theory, theoretical computer science, and measure theory.
Download or read it online for free here:
Download link
(2.6MB, PDF)
Similar books
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.
(2230 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.
(2230 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.
(5233 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.
(5233 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.
(15623 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.
(15623 views)
Computability Theory
by 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.
(4118 views)
by 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.
(4118 views)