Augmented loop languages and classes of computable functions
type: Item
instance of: scholarly article
title: Augmented loop languages and classes of computable functions
zbMATH Open document ID: 0312.68028
DOI: 10.1016/S0022-0000(72)80032-1
author: Michael Machtey
published in: Journal of Computer and System Sciences
publication date: 1972-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68N01
Mathematics Subject Classification ID: 03D20
zbMATH DE Number: 3488616
MaRDI profile type: Publication
cites work: On a Subrecursive Hierarchy and Primitive Recursive Degrees
cites work: On the structure of subrecursive degrees
cites work: A Machine-Independent Theory of the Complexity of Recursive Functions
cites work: A Hierarchy of Primitive Recursive Functions
cites work: Classifications of Recursive Functions by Means of Hierarchies
cites work: Computational speed-up by effective operators
cites work: Q5824357
cites work: On the Computational Complexity of Algorithms
cites work: Q5812175
cites work: Extension of an effectively generated class of functions by enumeration
cites work: The upper semi-lattice of degrees of recursive unsolvability
cites work: Q5612467
cites work: Q5678842
cites work: The honest subrecursive classes are a lattice
cites work: On the density of honest subrecursive classes
cites work: Classes of computable functions defined by bounds on computation
cites work: A Classification of the Recursive Functions
cites work: Q5583849
cites work: Gödel numberings of partial recursive functions
cites work: Degrees of Unsolvability. (AM-55)
full work available at URL: s0022-0000(72)80032-1
OpenAlex ID: W2144600960
description: scientific article; zbMATH DE number 3488616