An operator embedding theorem for complexity classes of recursive functions
type: Item
instance of: scholarly article
title: An operator embedding theorem for complexity classes of recursive functions
zbMATH Open document ID: 0326.68031
DOI: 10.1016/0304-3975(76)90055-4
author: Robert Moll
published in: Theoretical Computer Science
publication date: 1976-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3511589
MaRDI profile type: Publication
full work available at URL: 0304-3975(76)90055-4
OpenAlex ID: W2089245341
cites work: Diversity of speed-ups and embeddability in computational complexity
cites work: On classes of computable functions
cites work: A Machine-Independent Theory of the Complexity of Recursive Functions
cites work: Classes of computable functions defined by bounds on computation
cites work: Degrees of computational complexity
cites work: Classifications of Recursive Functions by Means of Hierarchies
cites work: Augmented loop languages and classes of computable functions
cites work: Computational speed-up by effective operators
cites work: Q5573961
cites work: Degrees of Unsolvability. (AM-55)
description: scientific article; zbMATH DE number 3511589