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

DOI10.1016/0304-3975(93)90286-3MaRDI QIDQ1314366zbMATHOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 2110614
• Strong time bounds: Non-computable bounds and a hierarchy theorem
• Adventures in time and space
• scientific article; zbMATH DE number 7250155
• Simple programming languages and restricted classes of Turing machines

Cites work

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 65747 (Why is no real title available?)
• scientific article; zbMATH DE number 3586480 (Why is no real title available?)
• scientific article; zbMATH DE number 3600024 (Why is no real title available?)
• scientific article; zbMATH DE number 236855 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• A connotational theory of program structure
• A note on natural complete sets and Goedel numberings
• Gödel numberings of partial recursive functions
• On Simple Goedel Numberings and Translations
• Remarks on recursion versus diagonalization and exponentially difficult problems
• Simple Gödel Numberings, Isomorphisms, and Programming Properties
• The Independence of Control Structures in Programmable Numberings of the Partial Recursive Functions
• The independence of control structures in abstract programming systems

Cited in

(2)

• scientific article; zbMATH DE number 605140 (Why is no real title available?)
• Control structures in hypothesis spaces: The influence on learning

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

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