Incompleteness theorems for random reals
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2123258 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- scientific article; zbMATH DE number 3062467 (Why is no real title available?)
- scientific article; zbMATH DE number 3074175 (Why is no real title available?)
- A Theory of Program Size Formally Identical to Information Theory
- Gödel's theorem and information
- Information-theoretic computation complexity
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Register machine proof of the theorem on exponential diophantine representation of enumerable sets
- The decision problem for exponential diophantine equations
- The definition of random sequences
Cited in
(38)- An incomplete set of shortest descriptions
- Quantum algorithmic randomness
- Computing halting probabilities from other halting probabilities
- On the computational power of random strings
- Oscillation in the initial segment complexity of random reals
- QUANTUM ALGORITHMS FOR GENERATING RANDOM SEQUENCES OF INTEGERS
- Fixed point theorems on partial randomness
- Computational depth and reducibility
- Computability and randomness of Nash equilibrium in infinite games
- \(\Sigma^ 0_ n\)-complete properties of programs and Martin-Löf randomness
- Reducibilities relating to Schnorr randomness
- Increasing the gap between descriptional complexity and algorithmic probability
- scientific article; zbMATH DE number 3943806 (Why is no real title available?)
- Information-theoretic incompleteness
- Randomness and reducibility
- The Kolmogorov complexity of random reals
- Things that can be made into themselves
- The dimensions of individual strings and sequences
- No random reals in countable support iterations
- A Suppes predicate for general relativity and set-theoretically generic spacetimes
- Prefix-free quantum Kolmogorov complexity
- scientific article; zbMATH DE number 558650 (Why is no real title available?)
- On independent random oracles
- Calibrating Randomness
- Closed left-r.e. sets
- On the Reals Which Cannot Be Random
- Random reals and possibly infinite computations Part I: Randomness in ∅′
- Computational depth and reducibility
- Efficient exact computation of iterated maps
- Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega
- Solovay functions and their applications in algorithmic randomness
- The Arnol'd cat: Failure of the correspondence principle
- The axiomatic power of Kolmogorov complexity
- Closed left-r.e. sets
- Is complexity a source of incompleteness?
- Feasible reductions to Kolmogorov-Loveland stochastic sequences
- On initial segment complexity and degrees of randomness
- An improved zero-one law for algorithmically random sequences
This page was built for publication: Incompleteness theorems for random reals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1105595)
