Abstract
The definition of a class C of functions is syntactic if membership to C can be decided from the construction of its elements. Syntactic characterizations of PTIMEF, of PSPACEF, of the polynomial hierarchy PH, and of its subclasses Δ pn are presented. They are obtained by progressive restrictions of recursion in Lisp, and may be regarded as predicative according to a foundational point raised by Leivant.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
S. Bellantoni and S. Cook, A new recursive characterization of the polytime funcions, in 24th Annual ACM STOC (1992) 283–293.
S. Caporaso, Safe Turing machines, Grzegorczyk classes and Polytime (to appear on Intern. J. Found. Comp. Sc.).
S. Caporaso and M. Zito, On a relation between uniform coding and problems of the form DTIME(F)=? DSPACE(F), submitted to Acta Informatica.
P. Clote, A time-space hierarchy between polynomial time and polynomial space, Math. Systems Theory, 25(1992) 77–92.
A. Cobham, The intrinsic computational complexity of functions, in Y. Bar Hillel, ed., Proc. Int. Conf. Logic, Methodology and Philosophy Sci. (North-Holland, Amsterdam, 1965) 24–30.
J. Hartmanis and R.E. Stearns, On the computational complexity of algorithms. Trans. A.M.S. 117(1965)285–306.
S.C. Kleene, Introduction to metamathematics (North-Holland, Amsterdam, 1952).
M. Kutylowski, A generalyzed Grzegorczyk hierarchy and low complexity classes, Information and Computation, 72.2(1987) 133–149.
D. Leivant, A foundational delineation of computational feasibility. 6th Annual IEEE symposium on Logic in computer science (1991).
D.Leivant and J.Y. Marion, Lambda calculus characterization of Poly-time (to appear on Fundamenta Informaticae).
M. Liskiewicz, K. Lorys, and M. Piotrow, The characterization of some complexity classes by recursion schemata, in Colloquia Mathematica Societatis János Bolyai, 44, (Pécs, 1984) 313–322.
Mecca and Bonner, Sequences, Datalog and transducers, PODS 1995 (reference to be revs'd in the final version of this paper).
C.H. Papadimitriou, A note on expressive power of PROLOG, Bull. EATCS, 26(1985) 21–23.
H. Poincaré Les mathématiques et la logique, Revue de Métaphisique et de Morale, 14(1906)297–317.
R. W. Ritchie, Classes of predictably computable functions, Trans. Am. Math. Soc. 106(1963) 139–173.
H.E. Rose, Subrecursion: Functions and hierarchies, (Oxford Press, Oxford, 1984).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caporaso, S., Zito, M., Galesi, N., Covino, E. (1997). Syntactic characterization in Lisp of the polynomial complexity classes and hierarchy. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds) Algorithms and Complexity. CIAC 1997. Lecture Notes in Computer Science, vol 1203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62592-5_61
Download citation
DOI: https://doi.org/10.1007/3-540-62592-5_61
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62592-6
Online ISBN: 978-3-540-68323-0
eBook Packages: Springer Book Archive