Logo

Computability and Randomness

Large book cover: Computability and Randomness

Computability and Randomness
by

Publisher: Oxford University Press
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

Book cover: Computability, Unsolvability, RandomnessComputability, Unsolvability, Randomness
by - 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.
(515 views)
Book cover: Prolog Experiments in Discrete Mathematics, Logic, and ComputabilityProlog Experiments in Discrete Mathematics, Logic, and Computability
by - 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.
(14919 views)
Book cover: Computability and Complexity from a Programming PerspectiveComputability and Complexity from a Programming Perspective
by - 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.
(7281 views)
Book cover: Recursion TheoryRecursion Theory
by - 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.
(6217 views)