Complexity dips in random infinite binary sequences
From MaRDI portal
Publication:4184762
DOI10.1016/S0019-9958(78)90062-1zbMath0399.94013OpenAlexW2066366917MaRDI QIDQ4184762
Publication date: 1978
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(78)90062-1
Related Items
Several results in program size complexity, Unnamed Item, Randomness and initial segment complexity for measures, Calibrating Randomness, Finite state incompressible infinite sequences