On the complexity of proving functions

Authors:
Andy N. C. Kang
Affiliations:
University of California, Berkeley, California
Venue:
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Year:
1971

Citing 3
Cited 0

Theory of recursive functions and effective computability

Theory of recursive functions and effective computability
A Machine-Independent Theory of the Complexity of Recursive Functions

Journal of the ACM (JACM)
On effective procedures for speeding up algorithms

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let f be a recursive function. We shall be interested in the following question: given x and y, how difficult is it to decide whether f(x) = y or f(x) ≠ y? Since the problem of deciding f(x) = y or f(x) ≠ y is the same problem as that of computing the characteristic function Cf of the graph of f, we can study the above question by looking into the complexity of computing Cf.