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

DOI10.1016/0304-3975(93)90286-3zbMATH Open0834.68003OpenAlexW2095539596MaRDI QIDQ1314366FDOQ1314366

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

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

zbMATH Keywords

computational complexitytime complexitycontrol structure

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• Control structures in hypothesis spaces: The influence on learning
• Title not available (Why is that?)

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)