LISP program-size complexity. III

DOI10.1016/0096-3003(92)90101-6zbMath0757.68067OpenAlexW3150615358WikidataQ127436353 ScholiaQ127436353MaRDI QIDQ1200220

Gregory J. Chaitin

Publication date: 17 January 1993

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

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

zbMATH Keywords

program-size complexityLISP halting probabilitiesparenthesis-free LISP

Mathematics Subject Classification ID

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

Related Items (1)

LISP program-size complexity. IV

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• LISP program-size complexity
• LISP program-size complexity. II
• LISP program-size complexity. IV
• On the Length of Programs for Computing Finite Binary Sequences
• On the Length of Programs for Computing Finite Binary Sequences

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