- The Equivalence of Definitions of Algorithmic Randomness.Christopher Porter - 2021 - Philosophia Mathematica 29 (2):153–194.details
|
|
Randomness, computation and mathematics.Rod Downey - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 162--181.details
|
|
Π 1 0 classes, L R degrees and Turing degrees.George Barmpalias, Andrew E. M. Lewis & Frank Stephan - 2008 - Annals of Pure and Applied Logic 156 (1):21-38.details
|
|
Upper bounds on ideals in the computably enumerable Turing degrees.George Barmpalias & André Nies - 2011 - Annals of Pure and Applied Logic 162 (6):465-473.details
|
|
The nature of probability.Patrick Suppes - 2010 - Philosophical Studies 147 (1):89 - 102.details
|
|
The K -Degrees, Low for K Degrees,and Weakly Low for K Sets.Joseph S. Miller - 2009 - Notre Dame Journal of Formal Logic 50 (4):381-391.details
|
|
Low upper bounds of ideals.Antonín Kučera & Theodore A. Slaman - 2009 - Journal of Symbolic Logic 74 (2):517-534.details
|
|
Denjoy, Demuth and density.Laurent Bienvenu, Rupert Hölzl, Joseph S. Miller & André Nies - 2014 - Journal of Mathematical Logic 14 (1):1450004.details
|
|
The computational content of intrinsic density.Eric P. Astor - 2018 - Journal of Symbolic Logic 83 (2):817-828.details
|
|
A random set which only computes strongly jump-traceable C.e. Sets.Noam Greenberg - 2011 - Journal of Symbolic Logic 76 (2):700 - 718.details
|
|
Benign cost functions and lowness properties.Noam Greenberg & André Nies - 2011 - Journal of Symbolic Logic 76 (1):289 - 312.details
|
|
Tracing and domination in the Turing degrees.George Barmpalias - 2012 - Annals of Pure and Applied Logic 163 (5):500-505.details
|
|
Kolmogorov complexity and computably enumerable sets.George Barmpalias & Angsheng Li - 2013 - Annals of Pure and Applied Logic 164 (12):1187-1200.details
|
|
Computing k-trivial sets by incomplete random sets.Laurent Bienvenu, Adam R. Day, Noam Greenberg, Antonín Kučera, Joseph S. Miller, André Nies & Dan Turetsky - 2014 - Bulletin of Symbolic Logic 20 (1):80-90.details
|
|
Demuth randomness and computational complexity.Antonín Kučera & André Nies - 2011 - Annals of Pure and Applied Logic 162 (7):504-513.details
|
|
Characterizing strong randomness via Martin-Löf randomness.Liang Yu - 2012 - Annals of Pure and Applied Logic 163 (3):214-224.details
|
|
Hyperimmune-free degrees and Schnorr triviality.Johanna N. Y. Franklin - 2008 - Journal of Symbolic Logic 73 (3):999-1008.details
|
|
Randomness notions and reverse mathematics.André Nies & Paul Shafer - 2020 - Journal of Symbolic Logic 85 (1):271-299.details
|
|
Jump inversions inside effectively closed sets and applications to randomness.George Barmpalias, Rod Downey & Keng Meng Ng - 2011 - Journal of Symbolic Logic 76 (2):491 - 518.details
|
|