Fixed Point Theorems on Partial Randomness

DOI10.1007/978-3-540-92687-0_29zbMath1211.68222arXiv0903.3433MaRDI 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 theory; fixed-point theorem; thermodynamic quantities; algorithmic randomness; partial randomness; Chaitin's \(\Omega \) number

Mathematics Subject Classification ID

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

82B03: Foundations of equilibrium statistical mechanics

03D32: Algorithmic randomness and dimension

Related Items

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

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