A note on the number of \(N\)-bit strings with maximum complexity

DOI10.1016/0096-3003(93)90037-FzbMath0791.68082OpenAlexW2003843727MaRDI QIDQ1316114

Gregory J. Chaitin

Publication date: 14 March 1994

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0096-3003(93)90037-f

zbMATH Keywords

program-size complexity\(n\)-bit strings

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items

New applications of the incompressibility method. II

Cites Work

• Unnamed Item