Email RIS file
Bookmark
Report an Issue

Computability and randomness / André Nies

Author
Nies, André
Published
Oxford ; New York : Oxford University Press, 2009.
Physical Description
1 online resource (xv, 433 pages) : illustrations
Access Online

Availability

I Want It
I Want It

Finding items...

Series
Contents
1 The complexity of sets; 2 The descriptive complexity of strings; 3 Martin-Löf randomness and its variants; 4 Diagonally noncomputable functions; 5 Lowness properties and K-triviality; 6 Some advanced computability theory; 7 Randomness and betting strategies; 8 Classes of computational complexity; 9 Higher computability and randomness; Solutions to the exercises; References; Notation Index; Index.
Summary
A monograph on the computational complexity and randomness of sets of natural numbers.
Subject(s)
ISBN
9780191552274 (electronic bk.)
0191552275 (electronic bk.)
9780191710988
0191710989
Bibliography Note
Includes bibliographical references and indexes.
Source of Acquisition
Purchased with funds from the Paterno Libraries Endowment; 2016
Endowment Note
Paterno Libraries Endowment
View MARC record | catkey: 19160064