Nonexistence of program optimizers in several abstract settings

DOI10.1016/S0022-0000(76)80008-6zbMath0339.68042MaRDI QIDQ1231391

Donald A. Alton

Publication date: 1976

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items

On the power of recursive optimizers ⋮ Indexings of subrecursive classes

Cites Work

• Time bounded random access machines
• On Families of Languages Defined by Time-Bounded Random Access Machines
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Some Results on Tape-Bounded Turing Machines
• Random-Access Stored-Program Machines, an Approach to Programming Languages
• Computational complexity of random access stored program machines
• An Overview of the Theory of Computational Complexity
• A Classification of the Recursive Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item