Computability and Randomness
Open accessThe DOI matches its Crossref record.
Abstract
2008 To my parents Christel and Otfrid with gratitudePREFACE The complexity and randomness aspects of sets 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. This book is about the two aspects of sets of natural numbers and about their interplay. Sets of natural numbers are identified with infinite sequences of zeros and ones, and simply called sets. Chapters 1 and 6 are mostly about the complexity aspect. We introduce lowness and highness properties of sets. Chapters 2, 3, and 7 are mostly about the randomness aspect. Firstly we study randomness of finite objects. Then we proceed to sets. We establish a hierarchy of mathematical randomness notions. Each notion matches our intuition of
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Dieguez, S., Wagner-Egger, P., & Gauvrit, N. (2015) · Psychological Science · doi:10.1177/0956797615598740 · Cited by 87
Metadata
- Authors
- Nies, A.
- Venue
- Oxford University Press eBooks
- Publisher
- Oxford University Press
- Published
- 2009-01-29
- OpenAlex
- W1579696469
- Cited by
- 614
- References
- 0
- FWCI
- 13.38
- Type
- book
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Computability and Randomness. https://app.cochat.ai/papers/10.1093/acprof:oso/9780199230761.001.0001
- The paper
- Nies, A. (2009). Computability and Randomness. Oxford University Press eBooks. https://doi.org/10.1093/acprof%3Aoso/9780199230761.001.0001
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.