Complexity classes of partial recursive functions
From MaRDI portal
Publication:1221487
DOI10.1016/S0022-0000(74)80039-5zbMath0315.68039OpenAlexW2060954489MaRDI QIDQ1221487
Publication date: 1974
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-0000(74)80039-5
Analysis of algorithms and problem complexity (68Q25) Recursive functions and relations, subrecursive hierarchies (03D20)
Cites Work
- Unnamed Item
- Unnamed Item
- On completely recursively enumerable classes and their key arrays
- Some Theorems on Classes of Recursively Enumerable Sets
- Classes of computable functions defined by bounds on computation
- Partial algorithm problems for context free languages
- A Machine-Independent Theory of the Complexity of Recursive Functions
- A Note on the Intersection of Complexity Classes of Functions
- Recursive Properties of Abstract Complexity Classes
- Classes of Recursively Enumerable Sets and Their Decision Problems
- Elementary properties of Abelian groups
This page was built for publication: Complexity classes of partial recursive functions
