Random Semicomputable Reals Revisited

DOI10.1007/978-3-642-27654-5_3zbMath1353.03051arXiv1110.5028OpenAlexW1918099480WikidataQ57349529 ScholiaQ57349529MaRDI QIDQ2891300

Laurent Bienvenu, Alexander Shen

Publication date: 15 June 2012

Published in: Computation, Physics and Beyond (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Computation over the reals, computable analysis (03D78)

Related Items (4)

What Percentage of Programs Halt? ⋮ Busy Beavers and Kolmogorov Complexity ⋮ Solovay functions and their applications in algorithmic randomness ⋮ SOME QUESTIONS OF UNIFORMITY IN ALGORITHMIC RANDOMNESS

Cites Work

• Unnamed Item
• Information-theoretic characterizations of recursive infinite strings
• Randomness and Recursive Enumerability
• Time-Bounded Kolmogorov Complexity and Solovay Functions
• Kolmogorov Complexity and Solovay Functions
• Forbidden information

This page was built for publication: Random Semicomputable Reals Revisited