Composition is almost (but not quite) as good as \(s-1-1\)
type: Item
instance of: scholarly article
title: Composition is almost (but not quite) as good as \(s-1-1\)
zbMATH Open document ID: 0834.68003
DOI: 10.1016/0304-3975(93)90286-3
author: Yves Marcoux
published in: Theoretical Computer Science
publication date: 1996-03-18T00:00:00Z
Mathematics Subject Classification ID: 68N01
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 501177
zbMATH Keywords: computational complexity
zbMATH Keywords: control structure
zbMATH Keywords: time complexity
MaRDI profile type: Publication
full work available at URL: 0304-3975(93)90286-3
OpenAlex ID: W2095539596
cites work: A note on natural complete sets and Goedel numberings
cites work: On Simple Goedel Numberings and Translations
cites work: Q3862379
cites work: Q4010358
cites work: Q5287559
cites work: Q4166747
cites work: Simple Gödel Numberings, Isomorphisms, and Programming Properties
cites work: Q4153600
cites work: Remarks on recursion versus diagonalization and exponentially difficult problems
cites work: The independence of control structures in abstract programming systems
cites work: The Independence of Control Structures in Programmable Numberings of the Partial Recursive Functions
cites work: Gödel numberings of partial recursive functions
cites work: Q5573961
cites work: A connotational theory of program structure
description: scientific article; zbMATH DE number 501177