Computability and Randomness

Nonfiction, Religion & Spirituality, Philosophy, Logic, Science & Nature, Mathematics, Computers, General Computing
Cover of the book Computability and Randomness by André Nies, OUP Oxford
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: André Nies ISBN: 9780191627880
Publisher: OUP Oxford Publication: March 29, 2012
Imprint: OUP Oxford Language: English
Author: André Nies
ISBN: 9780191627880
Publisher: OUP Oxford
Publication: March 29, 2012
Imprint: OUP Oxford
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from OUP Oxford

Cover of the book Pamela Hansford Johnson by André Nies
Cover of the book The Etruscans: A Very Short Introduction by André Nies
Cover of the book God's Own Ethics by André Nies
Cover of the book The Oxford Handbook of Quantitative Asset Management by André Nies
Cover of the book Skills in the Age of Over-Qualification by André Nies
Cover of the book A Life by André Nies
Cover of the book Lectures on Geometry by André Nies
Cover of the book Punishment and Responsibility by André Nies
Cover of the book Hobson-Jobson by André Nies
Cover of the book The Oxford Companion to Fairy Tales by André Nies
Cover of the book The Visual (Un)Conscious and Its (Dis)Contents by André Nies
Cover of the book Common Enemies: Crime, Policy, and Politics in Australia-Indonesia Relations by André Nies
Cover of the book Theory of Strategy by André Nies
Cover of the book Networks: A Very Short Introduction by André Nies
Cover of the book The Reformation: A Very Short Introduction by André Nies
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy