A New Representation of Chaitin Ω Number Based on Compressible Strings

DOI10.1007/978-3-642-13523-1_15zbMath1286.68254arXiv1004.0658OpenAlexW2131232520MaRDI QIDQ3575224

Kohtaro Tadaki

Publication date: 26 July 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

fixed pointalgorithmic information theoryrandomnesspartial randomnessChaitin \(\Omega \) numberprogram-size complexity

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (1)

On Oscillation-Free Chaitin h-Random Sequences

This page was built for publication: A New Representation of Chaitin Ω Number Based on Compressible Strings