Recursively enumerable reals and Chaitin numbers
From MaRDI portal
(Redirected from Recursively enumerable reals and Chaitin numbers)
Recursively enumerable reals and Chaitin \(\Omega\) numbers (scientific article; zbMATH DE number 1136091)
Recursively enumerable reals and Chaitin \(\Omega\) numbers (scientific article; zbMATH DE number 1136091)
Recommendations
Cited in
(23)- Recursive events in random sequences
- Chaitin numbers, Solovay machines, and Gödel incompleteness.
- The closure properties on real numbers under limits and computable operators.
- Presentations of computably enumerable reals.
- Epistemic horizons and the foundations of quantum mechanics
- A Chaitin number based on compressible strings
- Randomness and reducibility
- On Kurtz randomness
- The Kolmogorov complexity of random reals
- Random reals à la Chaitin with or without prefix-freeness
- Randomness and recursive enumerability
- Random semicomputable reals revisited
- Every computably enumerable random real is provably computably enumerable random
- What percentage of programs halt?
- A new representation of Chaitin \(\Omega \) number based on compressible strings
- scientific article; zbMATH DE number 1543065 (Why is no real title available?)
- Π11‐Martin‐Löf randomness and Π11‐Solovay completeness
- Computing a Glimpse of Randomness
- Weakly computable real numbers
- Recursively enumerable reals and Chaitin \(\Omega\) numbers
- A characterization of c. e. random reals
- Simplicity via provability for universal prefix-free Turing machines
- A c.e. real that cannot be sw-computed by any \(\Omega\) number
This page was built for publication: Recursively enumerable reals and Chaitin \(\Omega\) numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4381402)
