Randomness and halting probabilities
From MaRDI portal
Recommendations
Cites work
Cited in
(23)- Computing halting probabilities from other halting probabilities
- Randomness and universal machines
- Every computably enumerable random real is provably computably enumerable random
- \(\Sigma^ 0_ n\)-complete properties of programs and Martin-Löf randomness
- Random reals à la Chaitin with or without prefix-freeness
- scientific article; zbMATH DE number 4079400 (Why is no real title available?)
- Natural halting probabilities, partial randomness, and zeta functions
- What percentage of programs halt?
- From index sets to randomness in ∅n: random reals and possibly infinite computations part II
- Recursive events in random sequences
- Universality probability of a prefix-free machine
- scientific article; zbMATH DE number 1665444 (Why is no real title available?)
- scientific article; zbMATH DE number 1886067 (Why is no real title available?)
- The probability of a computable output from a random oracle
- Chaitin's \(\Omega\) as a continuous function
- A variant of Chaitin's Omega function
- RELATIVIZING CHAITIN'S HALTING PROBABILITY
- Chaitin's halting probability and the compression of strings using oracles
- Kolmogorov complexity in perspective. I: Information theory and randomness
- Randomness and uniform distribution modulo one
- Differences of halting probabilities
- Random numbers as probabilities of machine behavior
- Kobayashi compressibility
This page was built for publication: Randomness and halting probabilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3416122)