Subrecursive programming languages. II. On program size
From MaRDI portal
Publication:2546770
DOI10.1016/S0022-0000(71)80039-9zbMath0218.68011OpenAlexW2030169368MaRDI QIDQ2546770
Publication date: 1971
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(71)80039-9
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computer programming and formal systems
- Some definitional suggestions for automata theory
- On the Computational Complexity of Algorithms
- Classes of computable functions defined by bounds on computation
- Iteration of Primitive Recursion
- A Machine-Independent Theory of the Complexity of Recursive Functions
- On the Length of Programs for Computing Finite Binary Sequences
- On the size of machines
- Random-Access Stored-Program Machines, an Approach to Programming Languages
- Recursive Properties of Abstract Complexity Classes
- Computability of Recursive Functions
- A Hierarchy of Primitive Recursive Functions
- Primitive recursive functions
This page was built for publication: Subrecursive programming languages. II. On program size
