Computability and randomness

Rubriek: Textual/Printed/Reference Materials - Boek

Prijs: € 64.99

Rating: 0/5

☆

☆

☆

☆

☆

Verzending:
2 - 3 weken

A monograph on the interface of computational complexity and randomness of sets of natural numbers.



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.

• 1 Bekijk alle specificaties

Taal: en

Bindwijze: Paperback

Oorspronkelijke releasedatum: 29 maart 2012

Aantal pagina's: 435

Illustraties: Nee

Hoofdauteur: Andre Nies

Tweede Auteur: Andrae Nies

Hoofduitgeverij: Oxford University Press

Extra groot lettertype: Nee

Product breedte: 159 mm

Product hoogte: 32 mm

Product lengte: 235 mm

Studieboek: Ja

Verpakking breedte: 157 mm

Verpakking hoogte: 234 mm

Verpakking lengte: 29 mm

Verpakkingsgewicht: 721 g

EAN: 9780199652600

---