On initial segment complexity and degrees of randomness
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3861137 (Why is no real title available?)
- scientific article; zbMATH DE number 4008384 (Why is no real title available?)
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 3678157 (Why is no real title available?)
- scientific article; zbMATH DE number 107774 (Why is no real title available?)
- scientific article; zbMATH DE number 1834658 (Why is no real title available?)
- A Theory of Program Size Formally Identical to Information Theory
- A formal theory of inductive inference. Part I
- Algorithmic randomness and complexity.
- Complexity oscillations in infinite binary sequences
- Degrees of Unsolvability. (AM-55)
- Every 1-generic computes a properly 1-generic
- Every 2-random real is Kolmogorov random
- Every sequence is reducible to a random one
- Exact Expressions for Some Randomness Tests
- Incompleteness theorems for random reals
- Lowness for the class of random sets
- Lowness properties and randomness
- On the Length of Programs for Computing Finite Binary Sequences
- Oscillation in the initial segment complexity of random reals
- RELATIVIZING CHAITIN'S HALTING PROBABILITY
- Randomness and reducibility
- Randomness, relativization and Turing degrees
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- The Kolmogorov complexity of random reals
- The axiomatization of randomness
- The definition of random sequences
- There are 2^{ℵ₀} many 𝐻-degrees in the random reals
- Three approaches to the quantitative definition of information*
- Von Mises' definition of random sequences reconsidered
Cited in
(44)- Universal computably enumerable sets and initial segment prefix-free complexity
- On Resource-Bounded Versions of the van Lambalgen Theorem
- Randomness and initial segment complexity for measures
- Oscillation in the initial segment complexity of random reals
- Martin-Löf random quantum states
- Measure-theoretic applications of higher Demuth's theorem
- Random reals à la Chaitin with or without prefix-freeness
- Reducibilities relating to Schnorr randomness
- The sum \(2^{KM(x)-K(x)}\) over all prefixes \(x\) of some binary sequence can be infinite
- Energy randomness
- Two more characterizations of \(K\)-triviality
- Characterizing strong randomness via Martin-Löf randomness
- Cryptography and algorithmic randomness
- Initial segment complexities of randomness notions
- Being low along a sequence and elsewhere
- Strong jump-traceability. I: The computably enumerable case
- Demuth's path to randomness
- Phase transition between unidirectionality and bidirectionality
- Things that can be made into themselves
- Mass problems and initial segment complexity
- Algorithmic information theory and its statistical mechanical interpretation
- Chaitin's as a continuous function
- Coherence of reducibilities with randomness notions
- Degrees of randomized computability
- Chaitin's halting probability and the compression of strings using oracles
- Kolmogorov complexity in perspective. I: Information theory and randomness
- Complexity of inversion of functions on the reals
- Initial segment complexities of randomness notions
- On Martin’s pointed tree theorem
- Randomness with respect to c.e. semimeasures
- Kolmogorov complexity of initial segments of sequences and arithmetical definability
- Lowness properties and randomness
- Kolmogorov-Loveland randomness and stochasticity
- Large Turing independent sets
- Solovay functions and their applications in algorithmic randomness
- A basis theorem for Π₁⁰ classes of positive measure and jump inversion for random reals
- Cone avoidance and randomness preservation
- Two-Way Non-Uniform Finite Automata
- Randomness for computable measures and initial segment complexity
- Non-cupping and randomness
- Propagation of partial randomness
- Chaitin numbers and halting problems
- LUZIN’S (N) AND RANDOMNESS REFLECTION
- Continuous higher randomness
This page was built for publication: On initial segment complexity and degrees of randomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3506714)
