A generalization of Chaitin's halting probability \(\Omega\) and halting self-similar sets
From MaRDI portal
Publication:1599808
DOI10.14492/hokmj/1350911778zbMath0996.68071MaRDI QIDQ1599808
Publication date: 6 June 2002
Published in: Hokkaido Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.14492/hokmj/1350911778
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
28A80: Fractals
94A15: Information theory (general)
28A78: Hausdorff and packing measures
Related Items
On Oscillation-free ε-random Sequences, Solovay reducibility and continuity, Translating the Cantor set by a random real, Propagation of partial randomness, Strict process machine complexity, Fixed point theorems on partial randomness, Representation of left-computable \(\varepsilon \)-random reals, Constructive dimension equals Kolmogorov complexity, Natural halting probabilities, partial randomness, and zeta functions, Algorithmically independent sequences, Exact constructive and computable dimensions, A Chaitin \(\Omega\) number based on compressible strings, Monotonous betting strategies in warped casinos, The Kolmogorov complexity of infinite words, On partial randomness, Chaitin's omega and an algorithmic phase transition, On Oscillation-Free Chaitin h-Random Sequences, Phase Transition between Unidirectionality and Bidirectionality, Introduction: computability of the physical, A statistical mechanical interpretation of algorithmic information theory III: composite systems and fixed points, Algorithmic thermodynamics, MASS PROBLEMS AND INITIAL SEGMENT COMPLEXITY, Constructive Dimension and Hausdorff Dimension: The Case of Exact Dimension, Effective fractal dimensions, Partial Randomness and Dimension of Recursively Enumerable Reals, Algorithmic information theory and its statistical mechanical interpretation, Calibrating Randomness, An extension of Chaitin's halting probability Ω to a measurement operator in an infinite dimensional quantum system, Algorithmically Independent Sequences, Fixed Point Theorems on Partial Randomness, On universal computably enumerable prefix codes
