SOME QUESTIONS OF UNIFORMITY IN ALGORITHMIC RANDOMNESS

DOI10.1017/jsl.2021.58OpenAlexW3208227432MaRDI QIDQ5021930

Matthew Harrison-Trainor, Laurent Bienvenu, Barbara F. Csima

Publication date: 17 January 2022

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

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

zbMATH Keywords

Kolmogorov complexityalgorithmic randomness

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32)

Cites Work

• Unnamed Item
• Solovay functions and their applications in algorithmic randomness
• Universal recursively enumerable sets of strings
• Computability of probability measures and Martin-Löf randomness over metric spaces
• Randomness and Recursive Enumerability
• Randomness, Computability, and Density
• Random Semicomputable Reals Revisited
• A Note on the Differences of Computably Enumerable Reals
• Algorithmic Randomness and Complexity
• Relative randomness and real closed fields
• On universal computably enumerable prefix codes
• A Theory of Program Size Formally Identical to Information Theory
• Kolmogorov Complexity and Solovay Functions
• Weakly computable real numbers
• Recursively enumerable reals and Chaitin \(\Omega\) numbers

This page was built for publication: SOME QUESTIONS OF UNIFORMITY IN ALGORITHMIC RANDOMNESS