Abstract
We define a hierarchy of small sub-recursive classes, based on the schema of pure iteration. is compared with a similar hierarchy, based on primitive recursion, for which a collapse is equivalent to a collapse of the small Grzegorczyk-classes. Our hierarchy does collapse, and the induced relational class is shown to have a highly periodic structure; indeed a unary predicate is decidable in iff it is definable in Presburger Arithmetic. The concluding discussion contrasts our findings to those of Kutyłowski [12].
Chapter PDF
Similar content being viewed by others
References
Barra, M.: A characterisation of the relations definable in Presburger Arithmetic. In: Proceedings of TAMC 2008. LNCS, vol. 4978, pp. 258–269. Springer, Heidelberg (2008)
Clote, P.: Computation Models and Function Algebra. In: Handbook of Computability Theory. Elsevier, Amsterdam (1996)
Enderton, H.B.: A mathematical introduction to logic. Academic Press, Inc., San Diego (1972)
Grzegorczyk, A.: Some classes of recursive functions, in Rozprawy Matematyczne, No. IV, Warszawa (1953)
Jones, N.D.: LOGSPACE and PTIME characterized by programming languages. In: Theoretical Computer Science, vol. 228, pp. 151–174 (1999)
Jones, N.D.: The expressive power of higher-order types or, life without CONS. J. Functional Programming 11, 55–94 (2001)
Kristiansen, L.: Neat function algebraic characterizations of LOGSPACE and LINSPACE. Computational Complexity 14(1), 72–88 (2005)
Kristiansen, L., Barra, M.: The small Grzegorczyk classes and the typed λ-calculus. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol. 3526, pp. 252–262. Springer, Heidelberg (2005)
Kristiansen, L., Voda, P.J.: The surprising power of restricted programs and Gödel’s functionals. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 345–358. Springer, Heidelberg (2003)
Kristiansen, L., Voda, P.J.: Complexity classes and fragments of C. Information Processing Letters 88, 213–218 (2003)
Kristiansen, L., Voda, P.J.: The Structure of Detour Degrees. In: Proceedings of TAMC 2008. LNCS, vol. 4978, pp. 148–159. Springer, Heidelberg (2008)
Kutyłowski, M.: Small Grzegorczyk classes. J. London Math. Soc (2) 36, 193–210 (1987)
Rose, H.E.: Subrecursion. Functions and hierarchies. Clarendon Press, Oxford (1984)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barra, M. (2008). Pure Iteration and Periodicity. In: Beckmann, A., Dimitracopoulos, C., Löwe, B. (eds) Logic and Theory of Algorithms. CiE 2008. Lecture Notes in Computer Science, vol 5028. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69407-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-69407-6_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69405-2
Online ISBN: 978-3-540-69407-6
eBook Packages: Computer ScienceComputer Science (R0)