Recommendations
Cites work
- A Theory of Program Size Formally Identical to Information Theory
- Algorithmic Information Theory
- Algorithmic randomness and complexity.
- Creative sets
- Every sequence is reducible to a random one
- Lowness properties and randomness
- Randomness and recursive enumerability
- Randomness, relativization and Turing degrees
- Relative randomness and real closed fields
- The axiomatization of randomness
- The definition of random sequences
- There is no degree invariant half-jump
Cited in
(47)- \(\Pi_1^0 \) classes, LR degrees and Turing degrees
- PA RELATIVE TO AN ENUMERATION ORACLE
- Computing halting probabilities from other halting probabilities
- Universal recursively enumerable sets of strings
- Randomness and universal machines
- Effectively closed sets of measures and randomness
- Some more results on relativized Chaitin's
- Representation of left-computable \(\varepsilon \)-random reals
- \(\Sigma^ 0_ n\)-complete properties of programs and Martin-Löf randomness
- Relativized depth
- Random reals à la Chaitin with or without prefix-freeness
- A generalization of Chaitin's halting probability \(\Omega\) and halting self-similar sets
- Natural halting probabilities, partial randomness, and zeta functions
- The importance of \(\Pi^0_1\) classes in effective randomness
- Two more characterizations of \(K\)-triviality
- Analogues of Chaitin's Omega in the computably enumerable sets
- On the gap between trivial and nontrivial initial segment prefix-free complexity
- Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting)
- Lowness properties and approximations of the jump
- Things that can be made into themselves
- Universality probability of a prefix-free machine
- scientific article; zbMATH DE number 1665444 (Why is no real title available?)
- Calibrating Randomness
- Randomness and Computability: Open Questions
- The probability of a computable output from a random oracle
- Chaitin's as a continuous function
- A variant of Chaitin's Omega function
- Chaitin's halting probability and the compression of strings using oracles
- Randomness and halting probabilities
- Defining a randomness notion via another
- Depth, highness and DNR degrees
- Limit complexities, minimal descriptions, and n-randomness
- Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega
- Cone avoidance and randomness preservation
- Differences of halting probabilities
- THE REVERSE MATHEMATICS OF THEOREMS OF JORDAN AND LEBESGUE
- The axiomatic power of Kolmogorov complexity
- An extension of Chaitin's halting probability Ω to a measurement operator in an infinite dimensional quantum system
- Cupping with random sets
- Measures and their random reals
- Randomness and differentiability
- Non-cupping and randomness
- Difference randomness
- On initial segment complexity and degrees of randomness
- Propagation of partial randomness
- Chaitin numbers and halting problems
- Random numbers as probabilities of machine behavior
This page was built for publication: RELATIVIZING CHAITIN'S HALTING PROBABILITY
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3379458)
