LISP program-size complexity

DOI10.1016/0096-3003(92)90057-8zbMath0776.68064OpenAlexW2171509265MaRDI QIDQ1194454

Gregory J. Chaitin

Publication date: 27 September 1992

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

Full work available at URL: https://doi.org/10.1016/0096-3003(92)90057-8

zbMATH Keywords

program-size complexitycomputing finite binary sequenceslength of programs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (3)

LISP program-size complexity. II ⋮ LISP program-size complexity. III ⋮ LISP program-size complexity. IV

Cites Work

• On the Length of Programs for Computing Finite Binary Sequences
• On the Length of Programs for Computing Finite Binary Sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: LISP program-size complexity