Complexity oscillations in infinite binary sequences
From MaRDI portal
Cites work
Cited in
(30)- On the notion of infinite pseudorandom sequences
- Complexity of algorithms and computations
- Almost everywhere high nonuniform complexity
- Recursively compressible sets
- Computational depth and reducibility
- The dimensions of individual strings and sequences
- Thinking with notations: epistemic actions and epistemic activities in mathematical practice
- Process complexity and effective random tests
- The Kolmogorov complexity of infinite words
- Finite state incompressible infinite sequences
- An almost machine-independent theory of program-length complexity, sophistication, and induction
- Randomness: quantum versus classical
- Kolmogorov complexity and probability measures.
- On initial segment complexity and degrees of randomness
- An observation on probability versus randomness with applications to complexity classes
- Computational depth and reducibility
- On complexity classes and algorithmically random languages (extended abstract)
- Kolmogorov complexity in perspective. I: Information theory and randomness
- scientific article; zbMATH DE number 270263 (Why is no real title available?)
- Every 2-random real is Kolmogorov random
- A unified approach to the definition of random sequences
- Randomness, relativization and Turing degrees
- Kolmogorov complexity and cellular automata classification
- Martingales in the Study of Randomness
- Oscillation in the initial segment complexity of random reals
- Probabilistic issues in statistical mechanics
- Regainingly approximable numbers and sets
- Characterising the Martin-Löf random sequences using computably enumerable sets of measure one
- Natural halting probabilities, partial randomness, and zeta functions
- Information measures for infinite sequences
This page was built for publication: Complexity oscillations in infinite binary sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5613696)
