Abstract
We characterize the P space functions as the image in setv of a category initial in the doctrine of FP V-comprehensions having unary flat recursion and compatible unary and dyadic safe recursions. Here V is the partial order → ←. This characterization glues together, along the two sides of V, FP 2-comprehension based characterizations of linear space and P time.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Bellantoni and S. Cook. A new recursion-theoretic characterization of the polytime functions. In STOC Proceedings. ACM, 1992.
D. Bovet and P. Crescenzi. Introduction to the Theory of Complexity. Prentice Hall, 1994.
J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I. Springer-Verlag, 1988.
S. Bellantoni. Predicative Recursion and Computational Complexity. PhD thesis, Department of Computer Science, University of Toronto, 1992.
S. Bloch. Alternating function classes within P. Technical Report 92-16, Department of Computer Science, University of Manitoba, 1992.
F. Borceux. A Handbook of Categorical Algebra. Cambridge University Press, 1994. Volumes 1–2.
A. Cobham. The intrinsic computational difficulty of functions. In Y. Bar-Hillel, editor, Proceedings of the 1964 International Congress for Logic, Methodology, and the Philosophy of Science. North-Holland, 1965.
H. Huwig. Beziehungen Zwischen BeschrÄnkter Syntaktischer und BeschrÄnkter Primitiver Rekursion. PhD thesis, Informatik, UniversitÄt Dortmund, 1976.
B. Jacobs, E. Moggi, and T. Streicher. Impredicative type theories. In D. Pitt et al., editors, Category Theory and Computer Science, volume 530 of LNCS. Springer-Verlag, 1991.
G. Kelly. Elementary observations on 2-categorical limits. Bulletin of the Australian Mathematical Society, 39:301–317, 1989.
F. Lawvere. Equality in hyperdoctrines and comprehension schema as an adjoint functor. In A. Heller, editor, Applications of Categorical Algebra. AMS, 1970.
D. Leivant. Ramified recurrence and computational complexity I: Word algebras and poly-time. In P. Clote and J. Remmel, editors, Feasible Mathematics II. BirkhÄuser, 1994.
D. Leivant and J. Marion. Ramified recurrence and computational complexity II: Substitution and poly-space. Preprint, 1995.
J. Lambek and P. Scott. Introduction to Higher Order Categorical Logic. Cambridge University Press, 1986.
J. Otto. Complexity Doctrines. PhD thesis, McGill University, Montreal, Department of Mathematics and Statistics, 1995.
D. Pavlović. Predicates and Fibrations. PhD thesis, Faculteit der Wiskunde en Informatica, Rijksuniversiteit Utrech, 1990.
R. Ritchie. Classes of predictably computable functions. Transactions of the AMS, 106:137–173, 1963.
L. Román. Cartesian categories with natural numbers object. Journal of Pure and Applied Algebra, 58:267–278, 1989.
D. Thompson. Subrecursiveness: Machine-independent notations of computability in restricted time and storage. Mathematical Systems Theory, 6:3–15, 1972.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Otto, J.R. (1995). V-comprehensions and P space. In: Pitt, D., Rydeheard, D.E., Johnstone, P. (eds) Category Theory and Computer Science. CTCS 1995. Lecture Notes in Computer Science, vol 953. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60164-3_29
Download citation
DOI: https://doi.org/10.1007/3-540-60164-3_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60164-7
Online ISBN: 978-3-540-44661-3
eBook Packages: Springer Book Archive