Predecessor machines and regressing functions

Authors:
John C. Warkentin;Patrick C. Fischer
Affiliations:
-;-
Venue:
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Year:
1972

Citing 5
Cited 1

Computability of Recursive Functions

Journal of the ACM (JACM)
Random-Access Stored-Program Machines, an Approach to Programming Languages

Journal of the ACM (JACM)
The complexity of loop programs

ACM '67 Proceedings of the 1967 22nd national conference
Computational Complexity of Random Access Stored Program Machines

Computational Complexity of Random Access Stored Program Machines
Computation: finite and infinite machines

Computation: finite and infinite machines

Predecessor machines

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

A predecessor machine is a random-access machine with a predecessor operation (i.e., an instruction which subtracts 1 from the contents of a memory cell), but with no operation which can increase the contents of a cell. A regressing function is a total function which never yields an output larger than the maximum of its inputs and a constant. Unlike the situation for random-access machines with a successor operation, it does not matter whether or not predecessor machines with loop control also have conditional transfer instructions. Furthermore, the class of functions computable by predecessor loop machines consists of exactly those regressing functions which are computable by a deterministic linear-bounded automaton. Some generalized predecessor machines are also considered.