Nies, A and Shafer, P orcid.org/0000-0001-5386-9218 (2020) Randomness notions and reverse mathematics. Journal of Symbolic Logic, 85 (1). pp. 271-299. ISSN 0022-4812
Abstract
We investigate the strength of a randomness notion R as a set-existence principle in second-order arithmetic: for each Z there is an X that is R-random relative to Z. We show that the equivalence between 2-randomness and being infinitely often C-incompressible is provable in RCA0. We verify that RCA0 proves the basic implications among randomness notions: 2-random ⇒ weakly 2-random ⇒ Martin-L¨of random ⇒ computably random ⇒ Schnorr random. Also, over RCA0 the existence of computable randoms is equivalent to the existence of Schnorr randoms. We show that the existence of balanced randoms is equivalent to the existence of Martin--Löf randoms, and we describe a sense in which this result is nearly optimal.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2019, The Association for Symbolic Logic. This is an author produced version of a paper published in Journal of Symbolic Logic. Uploaded in accordance with the publisher's self-archiving policy. |
Keywords: | Primary 03B30; 03D32; 03F35; 68Q30; computability theory; reverse mathematics; algorithmic randomness; Kolmogorov complexity |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Mathematics (Leeds) > Pure Mathematics (Leeds) |
Depositing User: | Symplectic Publications |
Date Deposited: | 18 Sep 2019 09:03 |
Last Modified: | 04 Sep 2020 15:00 |
Status: | Published |
Publisher: | Cambridge University Press |
Identification Number: | 10.1017/jsl.2019.50 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:138230 |