Complexity oscillations in infinite binary sequences

From MaRDI portal
Publication:5613696

DOI10.1007/BF00534110zbMath0212.23103MaRDI QIDQ5613696

Per Martin-Löf

Publication date: 1971

Published in: Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete (Search for Journal in Brave)




Related Items (29)

Computational depth and reducibilityComputational depth and reducibilityCharacterising the Martin-Löf random sequences using computably enumerable sets of measure oneThe dimensions of individual strings and sequencesOn the notion of infinite pseudorandom sequencesThe Kolmogorov complexity of infinite wordsAn almost machine-independent theory of program-length complexity, sophistication, and inductionEvery 2-random real is Kolmogorov randomNatural halting probabilities, partial randomness, and zeta functionsAn observation on probability versus randomness with applications to complexity classesA unified approach to the definition of random sequencesOn complexity classes and algorithmically random languagesMartingales in the Study of RandomnessOn initial segment complexity and degrees of randomnessOscillation in the initial segment complexity of random realsComplexity of algorithms and computationsProbabilistic issues in statistical mechanicsUnnamed ItemAlmost everywhere high nonuniform complexityRandomness, relativization and Turing degreesProcess complexity and effective random testsInformation measures for infinite sequencesKolmogorov complexity and cellular automata classificationUnnamed ItemRandomness: Quantum versus classicalRecursively compressible setsKolmogorov Complexity in Perspective Part I: Information Theory and RandomnessThinking with notations: epistemic actions and epistemic activities in mathematical practiceFinite state incompressible infinite sequences




Cites Work




This page was built for publication: Complexity oscillations in infinite binary sequences