On minimal-program complexity measures

DOI10.1145/800169.805422MaRDI QIDQ5402506zbMATH OpenOpenAlexFDO

Authors Donald W. Loveland

Publication date 14 March 2014

Published in Proceedings of the first annual ACM symposium on Theory of computing - STOC '69 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/800169.805422

Mathematics Subject Classification ID

Computability and recursion theory (03D99) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Binary sequences. I: Complexity
• Descriptive complexity of computable sequences
• scientific article; zbMATH DE number 1304316
• Kolmogorov-Complexity Based on Infinite Computations
• scientific article; zbMATH DE number 3999902

Cited in

(26)

• Measuring static complexity
• LISP program-size complexity. III
• The extent and density of sequences within the minimal-program complexity hierarchies
• Descriptive complexity of computable sequences revisited
• Kolmogorov complexity of enumerating finite sets
• On the Turing degrees of minimal index sets
• Sequential predictions based on algorithmic complexity
• On the complexity of semantic self-minimization
• A note on Blum static complexity measures
• scientific article; zbMATH DE number 3847369 (Why is no real title available?)
• scientific article; zbMATH DE number 5117088 (Why is no real title available?)
• Kolmogorov-Complexity Based on Infinite Computations
• scientific article; zbMATH DE number 4045148 (Why is no real title available?)
• scientific article; zbMATH DE number 4047104 (Why is no real title available?)
• Strict process machine complexity
• Minimal-program complexity of pseudo-recursive and pseudo-random sequences
• scientific article; zbMATH DE number 3596250 (Why is no real title available?)
• scientific article; zbMATH DE number 1304316 (Why is no real title available?)
• scientific article; zbMATH DE number 3999902 (Why is no real title available?)
• Straight-line program length as a parameter for complexity measures
• On the problem of finding minimal programs for tables
• Program size complexity for possibly infinite computations
• A unified approach to the definition of random sequences
• Descriptive complexity of computable sequences
• Computation of recursive functionals using minimal initial segments
• Binary sequences. I: Complexity

This page was built for publication: On minimal-program complexity measures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5402506)