EXACT APPROXIMATIONS OF OMEGA NUMBERS
From MaRDI portal
Publication:3510206
DOI10.1142/S0218127407018130zbMath1149.03029OpenAlexW1964059180WikidataQ57001624 ScholiaQ57001624MaRDI QIDQ3510206
Michael J. Dinneen, Cristian S. Calude
Publication date: 2 July 2008
Published in: International Journal of Bifurcation and Chaos (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218127407018130
Related Items (6)
A Program-Size Complexity Measure for Mathematical Problems and Conjectures ⋮ How Much Information Can There Be in a Real Number? ⋮ HOW MUCH INFORMATION CAN THERE BE IN A REAL NUMBER? ⋮ Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega ⋮ Formal Proof: Reconciling Correctness and Understanding ⋮ INDUCTIVE COMPLEXITY MEASURES FOR MATHEMATICAL PROBLEMS
Cites Work
- Unnamed Item
- Unnamed Item
- Classical recursion theory. Vol. II
- Chaitin \(\Omega\) numbers, Solovay machines, and Gödel incompleteness.
- Randomness and Recursive Enumerability
- HOW MUCH INFORMATION CAN THERE BE IN A REAL NUMBER?
- Algorithmic Information Theory
- A Theory of Program Size Formally Identical to Information Theory
- Recursively enumerable reals and Chaitin \(\Omega\) numbers
- A characterization of c. e. random reals
This page was built for publication: EXACT APPROXIMATIONS OF OMEGA NUMBERS
