Fixed point theorems on partial randomness
DOI10.1016/J.APAL.2011.09.018zbMATH Open1247.03088OpenAlexW2949413845MaRDI QIDQ408531FDOQ408531
Authors: Kohtaro Tadaki 
Publication date: 10 April 2012
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2011.09.018
Recommendations
- Fixed Point Theorems on Partial Randomness
- Some random fixed point theorems
- Some random fixed point theorems
- Random fixed point theorems and approximation
- Notes on random fixed point theorems
- Random fixed point theorems under mild continuity assumptions
- Random approximations and fixed point theorems
- Random approximations and random fixed point theorems
fixed-point theoremalgorithmic randomnesspartial randomnessalgorithmic information theoryChaitin \(\Omega \) numberthermodynamic quantities
Algorithmic randomness and dimension (03D32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Foundations of equilibrium statistical mechanics (82B03)
Cites Work
- Algorithmic randomness and complexity.
- On partial randomness
- A Theory of Program Size Formally Identical to Information Theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Incompleteness theorems for random reals
- Title not available (Why is that?)
- A generalization of Chaitin's halting probability \(\Omega\) and halting self-similar sets
- Hierarchies of randomness tests
- 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ô.
- Information, randomness and incompleteness. Papers on algorithmic information theory
- Natural halting probabilities, partial randomness, and zeta functions
Cited In (8)
- Randomness on full shift spaces
- Automata, Languages and Programming
- On the random version of Ważewski theorem
- JSL volume 79 issue 2 Cover and Front matter
- A statistical mechanical interpretation of algorithmic information theory. III: Composite systems and fixed points
- Algorithmic information theory and its statistical mechanical interpretation
- Fixed Point Theorems on Partial Randomness
- Theorems on the variable-length intrinsic randomness
This page was built for publication: Fixed point theorems on partial randomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408531)
