Difference randomness
From MaRDI portal
Publication:3082303
DOI10.1090/S0002-9939-2010-10513-0zbMath1214.03029MaRDI QIDQ3082303
Johanna N. Y. Franklin, Keng Meng Ng
Publication date: 10 March 2011
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Related Items (19)
Demuth’s Path to Randomness ⋮ When does randomness come from randomness? ⋮ Shift-complex sequences ⋮ Initial segment complexities of randomness notions ⋮ DEGREES OF RANDOMIZED COMPUTABILITY ⋮ Cupping with random sets ⋮ JSL volume 79 issue 2 Cover and Front matter ⋮ DEEP CLASSES ⋮ RANDOMNESS NOTIONS AND REVERSE MATHEMATICS ⋮ HIGHER RANDOMNESS AND GENERICITY ⋮ Computing from projections of random points ⋮ Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions ⋮ Lowness for difference tests ⋮ ON THE INTERPLAY BETWEEN EFFECTIVE NOTIONS OF RANDOMNESS AND GENERICITY ⋮ Relatively computably enumerable reals ⋮ DEMUTH’S PATH TO RANDOMNESS ⋮ Continuous higher randomness ⋮ Denjoy, Demuth and density ⋮ A Church-Turing thesis for randomness?
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classical recursion theory. The theory of functions and sets of natural numbers
- Classical recursion theory. Vol. II
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
- Lowness properties and randomness
- Lowness notions, measure and domination
- Algorithmic Randomness and Complexity
- RELATIVIZING CHAITIN'S HALTING PROBABILITY
- Lowness and nullsets
- Randomness and Computability: Open Questions
- Using random sets as oracles
- Trial and error predicates and the solution to a problem of Mostowski
- The definition of random sequences
- Randomness, relativization and Turing degrees
This page was built for publication: Difference randomness
