Total complexity and the inference of best programs

DOI10.1007/BF01683271MaRDI QIDQ4133125zbMATH OpenFDO

Authors Jerome A. Feldman, Paul Shields

Publication date 1977

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01683271

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cites work

• A Machine-Independent Theory of the Complexity of Recursive Functions
• An Overview of the Theory of Computational Complexity
• Experiments with a Heuristic Compiler
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• scientific article; zbMATH DE number 3403744 (Why is no real title available?)
• scientific article; zbMATH DE number 3408934 (Why is no real title available?)
• scientific article; zbMATH DE number 3412190 (Why is no real title available?)
• Language identification in the limit
• Limiting recursion
• On the Efficiency of Algorithms
• On the inference of Turing machines from sample computations
• On the size of machines
• Some decidability results on grammatical inference and complexity

Cited in

(1)

• On the inference of Turing machines from sample computations

This page was built for publication: Total complexity and the inference of best programs

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