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 Globalization for Development by André Nies
Cover of the book The Law of TUPE Transfers by André Nies
Cover of the book Swann in Love by André Nies
Cover of the book Urban Ecology by André Nies
Cover of the book Atonement by André Nies
Cover of the book Hermann Cohen by André Nies
Cover of the book Does Terrorism Work? by André Nies
Cover of the book The State as Cultural Practice by André Nies
Cover of the book Secularization and Religious Innovation in the North Atlantic World by André Nies
Cover of the book The Johannine Renaissance in Early Modern English Literature and Theology by André Nies
Cover of the book Drugs in Cancer Care by André Nies
Cover of the book The Earth: A Very Short Introduction by André Nies
Cover of the book The Oxford Handbook of Terrorism by André Nies
Cover of the book The Concise Oxford Dictionary of Politics and International Relations by André Nies
Cover of the book Islamic History: 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