Computability And Randomness (oxford Logic Guides)
by André Nies /
2009 / English / PDF
5.8 MB Download
The interplay between computability and randomness has been an
active area of research in recent years, reflected by ample funding
in the USA, numerous workshops, and publications on the subject.
The complexity and the randomness aspect of a set of natural
numbers are closely related. Traditionally, computability theory is
concerned with the complexity aspect. However, computability
theoretic tools can also be used to introduce mathematical
counterparts for the intuitive notion of randomness of a set.
Recent research shows that, conversely, concepts and methods
originating from randomness enrich computability theory.
The interplay between computability and randomness has been an
active area of research in recent years, reflected by ample funding
in the USA, numerous workshops, and publications on the subject.
The complexity and the randomness aspect of a set of natural
numbers are closely related. Traditionally, computability theory is
concerned with the complexity aspect. However, computability
theoretic tools can also be used to introduce mathematical
counterparts for the intuitive notion of randomness of a set.
Recent research shows that, conversely, concepts and methods
originating from randomness enrich computability theory.
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.
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.