Composition is almost (but not quite) as good as \(s-1-1\)

DOI10.1016/0304-3975(93)90286-3zbMath0834.68003OpenAlexW2095539596MaRDI QIDQ1314366

Yves Marcoux

Publication date: 18 March 1996

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(93)90286-3

zbMATH Keywords

computational complexitytime complexitycontrol structure

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) General topics in the theory of software (68N01)

Related Items (2)

Control structures in hypothesis spaces: The influence on learning ⋮ Unnamed Item

Cites Work

• A connotational theory of program structure
• The independence of control structures in abstract programming systems
• Remarks on recursion versus diagonalization and exponentially difficult problems
• A note on natural complete sets and Goedel numberings
• The Independence of Control Structures in Programmable Numberings of the Partial Recursive Functions
• Gödel numberings of partial recursive functions
• Simple Gödel Numberings, Isomorphisms, and Programming Properties
• On Simple Goedel Numberings and Translations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Composition is almost (but not quite) as good as \(s-1-1\)