DEMUTH’S PATH TO RANDOMNESS

DOI10.1017/BSL.2015.24zbMath1348.03002arXiv1404.4449OpenAlexW2586636672MaRDI QIDQ2795307

Christopher P. Porter, André Nies, Antonín Kučera

Publication date: 21 March 2016

Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.4449

zbMATH Keywords

algorithmic randomnessDemuth randomnesssemigenericityDemuthDenjoy alternative

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) Constructive and recursive analysis (03F60) History of mathematical logic and foundations (03-03) Algorithmic randomness and dimension (03D32) Computation over the reals, computable analysis (03D78)

Related Items (3)

On the Reals Which Cannot Be Random ⋮ Lowness, Randomness, and Computable Analysis ⋮ Randomness for computable measures and initial segment complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computably enumerable sets below random sets
• Demuth randomness and computational complexity
• Markov's constructive analysis; a participant's view
• A blend of methods of recursion theory and topology.
• Strong reductions in effective randomness
• Lowness properties and approximations of the jump
• Randomness, Computability, and Density
• CHARACTERIZING LOWNESS FOR DEMUTH RANDOMNESS
• Difference randomness
• Kolmogorov complexity and the Recursion Theorem
• Algorithmic Randomness and Complexity
• On initial segment complexity and degrees of randomness
• MASS PROBLEMS AND HYPERARITHMETICITY
• Strong jump-traceability and Demuth randomness
• A unified approach to the definition of random sequences
• The definition of random sequences
• Randomness, relativization and Turing degrees

This page was built for publication: DEMUTH’S PATH TO RANDOMNESS