Processing ......
Links to Free Computer, Mathematics, Technical Books all over the World
Computability and Randomness
Top Free C++ Books 🌠 - 100% Free or Open Source!
  • Title: Computability and Randomness
  • Author(s) Andre Nies
  • Publisher: Oxford University Press (May 16, 2012); eBook (Final Draft of 2008 Edition)
  • Paperback: 456 pages
  • eBook: PDF (447 pages)
  • Language: English
  • ISBN-10: 0199652600
  • ISBN-13: 978-0199652600
  • Share This:  

Book Description

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 book covers topics such as lowness and highness properties, Kolmogorov complexity, betting strategies and higher computability.

Both the basics and recent research results are desribed, providing 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.

The book is intended for graduate students and researchers in mathematical logic, foundations of mathematics, and theoretical computer science. It includes a detailed treatment of Turing's theory of computability and unsolvability as subsequently developed by Kleene, Post, Friedberg, and many other researchers up to the present.

About the Authors
  • N/A

Reviews, Ratings, and Recommendations: Related Book Categories: Read and Download Links: Similar Books:
Book Categories
Other Categories
Resources and Links