APL and the Grzegorczyk hierarchy

Authors:
Seth Breidbart
Affiliations:
Computer Science Department, Cornell University, Upson Hall, Ithaca, N.Y.
Venue:
APL '79 Proceedings of the international conference on APL: part 1
Year:
1979

Citing 3
Cited 0

Theory of recursive functions and effective computability

Theory of recursive functions and effective computability
The complexity of loop programs

ACM '67 Proceedings of the 1967 22nd national conference
A programming language

A programming language

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show in this paper that the set of “traditional” APL l-liners (using arithmetic functions only) compute precisely the set of functions in the class E4 of the Grzegorczyk hierarchy (the class immediately above the elementary functions). We also show that if we extend the set of 1-liners to include either the “execute” operator, or 1 line programs with gotos, then any partial recursive function can be computed.