Depth-bounded computation

Authors:
H. R. Strong
Affiliations:
-
Venue:
Journal of Computer and System Sciences
Year:
1970

Citing 3
Cited 0

A Machine-Independent Theory of the Complexity of Recursive Functions

Journal of the ACM (JACM)
Algebraically generalized recursive function theory

IBM Journal of Research and Development
Parallel program schemata

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.01

Visualization

Abstract

A programming language designed for studies of parallelism and based on Wagner'suniformly reflexive structures is introduced. The measure of depth of computation in the language is studied. The partial recursive functions are shown to be computable in uniformly bounded depth. A comparison of the measure with other proposed measures of computational complexity leads to the suggestion of a list of properties to be checked in classifying such measures.