Total complexity and the inference of best programs

DOI10.1007/BF01683271zbMath0357.68044MaRDI QIDQ4133125

Paul C. Shields, Jerome A. Feldman

Publication date: 1977

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

Mathematics Subject Classification ID

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

Related Items (1)

On the inference of Turing machines from sample computations

Cites Work

• On the inference of Turing machines from sample computations
• A Machine-Independent Theory of the Complexity of Recursive Functions
• On the size of machines
• Limiting recursion
• On the Efficiency of Algorithms
• An Overview of the Theory of Computational Complexity
• Some decidability results on grammatical inference and complexity
• Language identification in the limit
• Experiments with a Heuristic Compiler
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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