Randomness and recursive enumerability
From MaRDI portal
Recommendations
Cited in
(56)- Computability of Real Numbers
- Relative randomness and cardinality
- Random semicomputable reals revisited
- Computing halting probabilities from other halting probabilities
- Schnorr randomness
- EXACT APPROXIMATIONS OF OMEGA NUMBERS
- Universal recursively enumerable sets of strings
- Time-bounded Kolmogorov complexity and Solovay functions
- Randomness and universal machines
- Recursively enumerable reals and Chaitin \(\Omega\) numbers
- On the hierarchy and extension of monotonically computable real numbers.
- Randomization and eventual reordering: a number theoretic approach
- Information: The Algorithmic Paradigm
- Undecidability of the structure of the Solovay degrees of c.e. reals
- Representation of left-computable \(\varepsilon \)-random reals
- Π11‐Martin‐Löf randomness and Π11‐Solovay completeness
- A Note on the Differences of Computably Enumerable Reals
- Natural halting probabilities, partial randomness, and zeta functions
- Schnorr randomness
- On Kurtz randomness
- What percentage of programs halt?
- Kolmogorov complexity as a language
- The closure properties on real numbers under limits and computable operators.
- Randomness, relativization and Turing degrees
- Randomness and reducibility
- The Kolmogorov complexity of random reals
- Array nonrecursiveness and relative recursive enumerability
- A Chaitin number based on compressible strings
- Randomness, computation and mathematics
- Computing a Glimpse of Randomness
- Phase transition between unidirectionality and bidirectionality
- Things that can be made into themselves
- SOME QUESTIONS OF UNIFORMITY IN ALGORITHMIC RANDOMNESS
- Simplicity via provability for universal prefix-free Turing machines
- Universality probability of a prefix-free machine
- Calibrating Randomness
- Algorithmic information theory and its statistical mechanical interpretation
- Randomness and Solovay degrees
- A variant of Chaitin's Omega function
- RELATIVIZING CHAITIN'S HALTING PROBABILITY
- Randomness and halting probabilities
- Chaitin numbers, Solovay machines, and Gödel incompleteness.
- Universal Recursively Enumerable Sets of Strings
- Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega
- Solovay functions and their applications in algorithmic randomness
- Differences of halting probabilities
- Trivial Reals
- Partial Randomness and Dimension of Recursively Enumerable Reals
- Reordered computable numbers
- There are 2^{ℵ₀} many 𝐻-degrees in the random reals
- On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. Reals
- Time-Bounded Kolmogorov Complexity and Solovay Functions
- Working with strong reducibilities above totally -c.e. and array computable degrees
- Chaitin numbers and halting problems
- Random numbers as probabilities of machine behavior
- Kobayashi compressibility
This page was built for publication: Randomness and recursive enumerability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2784448)
