Abstract
It is shown that the addition of “provability” requirements to the definitions of
and
does not seem to simplify the
=
question.
Similar content being viewed by others
References
P. C. Fischer, “Theory of provable functions,”Trans. Amer. Math. Soc. 117, 494–520 (1965).
J. Hartmanis, “Relations between diagonalization, proof systems, and complexity gaps,”Proceedings of the Ninth Annual ACM Symposium on Theory of Computing, Boulder, Colorado, 223–227 (1977).
H. Rogers, Jr.,Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.
P. R. Young, “Optimization among provably equivalent programs,”J. Assoc. Comput. Mach. 24, 693–700 (1977).
Author information
Authors and Affiliations
Additional information
This work partially supported by NSF grants DCR75-06340 and MCS77-24098.
Rights and permissions
About this article
Cite this article
Baker, T.P. On “provable” analogs of and . Math. Systems Theory 12, 213–218 (1978). https://doi.org/10.1007/BF01776574
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01776574