Continuous randomness via transformations of 2-random sequences

DOI10.1016/j.ic.2023.105028OpenAlexW4360999645MaRDI QIDQ6040663

Christopher P. Porter

Publication date: 19 May 2023

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2023.105028

zbMATH Keywords

Martin-Löf randomnessalgorithmic randomness2-randomnessTuring reductionscontinuous randomness

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Demuth randomness and computational complexity
• Mathematical metaphysics of randomness
• The random members of a \({\Pi }_{1}^{0}\) class
• Randomness for non-computable measures
• The typical Turing degree
• Algorithmic Randomness and Complexity
• Lowness and nullsets
• Pseudo Jump Operators. I: The R. E. Case
• Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
• General random sequences and learnable sequences
• Kolmogorov Complexity and Algorithmic Randomness
• Decidability of the “almost all” theory of degrees
• K-TRIVIALS ARE NEVER CONTINUOUSLY RANDOM
• Algorithmic Randomness
• Measures and their random reals
• Mass problems and almost everywhere domination
• Degrees of Unsolvability. (AM-55)
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• Randomness, relativization and Turing degrees
• Effective randomness for continuous measures

This page was built for publication: Continuous randomness via transformations of 2-random sequences