Complexity dips in random infinite binary sequences

DOI10.1016/S0019-9958(78)90062-1zbMath0399.94013OpenAlexW2066366917MaRDI QIDQ4184762

Howard P. Katseff

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

zbMATH Keywords

Arithmetic CodeRandom Infinite Binary Sequences

Mathematics Subject Classification ID

Other types of codes (94B60) Arithmetic codes (94B40)

Related Items

Several results in program size complexity, Unnamed Item, Randomness and initial segment complexity for measures, Calibrating Randomness, Finite state incompressible infinite sequences