SOME QUESTIONS OF UNIFORMITY IN ALGORITHMIC RANDOMNESS

DOI10.1017/JSL.2021.58MaRDI QIDQ5021930zbMATH OpenOpenAlexFDO

Authors Laurent Bienvenu, Matthew Harrison-Trainor, Barbara Csima

Publication date 17 January 2022

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

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

zbMATH Keywords

algorithmic randomnessKolmogorov complexity

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32)

Recommendations

• Differences of halting probabilities
• Randomness and universal machines
• RELATIVIZING CHAITIN'S HALTING PROBABILITY
• A Note on the Differences of Computably Enumerable Reals
• Randomness and halting probabilities

Cites work

• A Note on the Differences of Computably Enumerable Reals
• A Theory of Program Size Formally Identical to Information Theory
• Algorithmic randomness and complexity.
• Computability and randomness
• Computability of probability measures and Martin-Löf randomness over metric spaces
• Kolmogorov complexity and solovay functions
• On universal computably enumerable prefix codes
• Random semicomputable reals revisited
• Randomness and recursive enumerability
• Randomness, computability, and density
• Recursively enumerable reals and Chaitin \(\Omega\) numbers
• Relative randomness and real closed fields
• Solovay functions and their applications in algorithmic randomness
• Universal recursively enumerable sets of strings
• Weakly computable real numbers

Cited in

(3)

• Uniform test of algorithmic randomness over a general space
• Mathematical Foundations of Computer Science 2004
• Some Questions of Uniformity in Algorithmic Randomness

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5021930)