Predecessor machines

DOI10.1016/S0022-0000(74)80055-3zbMath0278.68048MaRDI QIDQ1394128

Patrick C. Fischer, John C. Warkentin

Publication date: 1974

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Regressive computations characterize logarithmic space ⋮ Unbounded recursion and non-size-increasing functions ⋮ Simple programming languages and restricted classes of Turing machines

Cites Work

• Unnamed Item
• Unnamed Item
• Classes of Predictably Computable Functions
• Random-Access Stored-Program Machines, an Approach to Programming Languages
• Computational complexity of random access stored program machines
• Subrecursive Programming Languages, Part I
• Computability of Recursive Functions

This page was built for publication: Predecessor machines