Fixed Point Theorems on Partial Randomness

DOI10.1007/978-3-540-92687-0_29zbMath1211.68222arXiv0903.3433OpenAlexW2167685571MaRDI QIDQ3605545

Kohtaro Tadaki

Publication date: 24 February 2009

Published in: Logical Foundations of Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

algorithmic information theoryfixed-point theoremthermodynamic quantitiesalgorithmic randomnesspartial randomnessChaitin's \(\Omega \) number

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Foundations of equilibrium statistical mechanics (82B03) Algorithmic randomness and dimension (03D32)

Related Items (3)

Partial Randomness and Dimension of Recursively Enumerable Reals ⋮ Introduction: computability of the physical ⋮ A Chaitin \(\Omega\) number based on compressible strings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Natural halting probabilities, partial randomness, and zeta functions
• Effectively closed sets of measures and randomness
• Infinite subsets of random sets of integers
• Statistical physics I. Equilibrium statistical mechanics. Rev. transl. from the Japanese ed. by Morikazu Toda and Nobuhiko Saitô.
• A generalization of Chaitin's halting probability \(\Omega\) and halting self-similar sets
• On partial randomness
• Algorithmic Randomness and Complexity
• Algorithmic Information Theory
• A Theory of Program Size Formally Identical to Information Theory

This page was built for publication: Fixed Point Theorems on Partial Randomness