Abstract computational complexity and cycling computations

Authors:
Giorgio Ausiello
Affiliations:
-
Venue:
Journal of Computer and System Sciences
Year:
1971

Citing 4
Cited 1

A Machine-Independent Theory of the Complexity of Recursive Functions

Journal of the ACM (JACM)
Recursive properties of abstract complexity classes (Preliminary Version)

STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
On bounds on the number of steps to compute functions

STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
On classes of computable functions

STOC '69 Proceedings of the first annual ACM symposium on Theory of computing

Weak complexity measures

ACM SIGACT News

Quantified Score

Hi-index	0.00

Visualization

Abstract

A weakening of Blum's Axioms for abstract computational complexity is introduced in order to take into a better account measures that can be finite even when the computations diverge. How the new axioms affect the theory and how they can be used to get an insight in the theory of computations using a finite amount of resource, is shown.