Abstract
We study the expressive power non-size increasing recursive definitions over lists. This notion of computation is such that the size of all intermediate results will automatically be bounded by the size of the input so that the interpretation in a finite model is sound with respect to the standard semantics. Many well-known algorithms with this property such as the usual sorting algorithms are definable in the system in the natural way. The main result is that a characteristic function is definable if and only if it is computable in time O(2p(n)) for some polynomial p. The method used to establish the lower bound on the expressive power also shows that the complexity becomes polynomial time if we allow primitive recursion only. This settles an open question posed in [1,6]. The key tool for establishing upper bounds on the complexity of derivable functions is an interpretation in a finite relational model whose correctness with respect to the standard interpretation is shown using a semantic technique.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Klaus Aehlig and Helmut Schwichtenberg. A syntactical analysis of non-size-increasing polynomial time computation. In Proceedings of the Fifteenth IEEE Symposium on Logic in Computer Science (LICS’ 00), Santa Barbara, 2000.
Stephen Bellantoni and Stephen Cook. New recursion-theoretic characterization of the polytime functions. Computational Complexity, 2:97–110, 1992.
Vuokko-Helena Caseiro. Equations for Defining Poly-time Functions. PhD thesis, University of Oslo, 1997. Available by ftp from ftp://ftp.ifi.uio.no/pub/vuokko/0adm.ps.
Stephen A. Cook. Linear-time simulation of deterministic two-way pushdown automata. Information Processing, 71:75–80, 1972.
Andreas Goerdt. Characterizing complexity classes by higher type primitive recursive definitions. Theoretical Computer Science, 100:45–66, 1992.
Martin Hofmann. Linear types and non size-increasing polynomial time computation. To appear in Information and Computation. See http://www.dcs.ed.ac.uk/home/papers/icc.ps.gz for a draft. An extended abstract has appeared under the same title in Proc. Symp. Logic in Comp. Sci. (LICS) 1999, Trento, 2000.
Martin Hofmann. A type system for bounded space and functional in-place update. Nordic Journal of Computing, 7(4), 2000. An extended abstract has appeared in Programming Languages and Systems, G. Smolka, ed., Springer LNCS, 2000.
Martin Hofmann. The strength of non size-increasing computation. 2001. Presented at the workshop Implicit Computational Complexity 2001, Aarhus, 20 May 2001. Submitted for publication. See also http://www.dcs.ed.ac.uk/home/mxh/icc01hofmann.ps.
Neil Jones. The Expressive Power of Higher-Order Types or, Life without CONS. Journal of Functional Programming, 2001. to appear.
Daniel Leivant. Stratified Functional Programs and Computational Complexity. In Proc. 20th IEEE Symp. on Principles of Programming Languages, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hofmann, M. (2001). The Strength of Non-size-increasing Computation (Introduction and Summary). In: Sgall, J., Pultr, A., Kolman, P. (eds) Mathematical Foundations of Computer Science 2001. MFCS 2001. Lecture Notes in Computer Science, vol 2136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44683-4_6
Download citation
DOI: https://doi.org/10.1007/3-540-44683-4_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42496-3
Online ISBN: 978-3-540-44683-5
eBook Packages: Springer Book Archive