Turing degrees and randomness for continuous measures

DOI10.1007/s00153-023-00873-7arXiv1910.11213OpenAlexW4380843013MaRDI QIDQ6178468

Jan Reimann, Ming-Yang Li

Publication date: 18 January 2024

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

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

zbMATH Keywords

algorithmic randomnessTuring degreescontinuous measuresrecursively enumerable and abovemoduli of computation

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28) Algorithmic randomness and dimension (03D32)

Cites Work

• Unnamed Item
• Unnamed Item
• Effectively closed sets of measures and randomness
• Members of countable \(\Pi ^ 0_ 1\) classes
• Randomness for non-computable measures
• Turing Computability
• Algorithmic Randomness and Complexity
• K-TRIVIALS ARE NEVER CONTINUOUSLY RANDOM
• Measures and their random reals
• Computability and Randomness
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• The definition of random sequences
• Effective randomness for continuous measures

This page was built for publication: Turing degrees and randomness for continuous measures