Abstract
Roughly speaking, a recurrence relation is nested if it contains a subexpression of the form …A(…A(…)…). Many nested recurrence relations occur in the literature, and determining their behavior seems to be quite difficult and highly dependent on their initial conditions. A nested recurrence relation A(n) is said to be undecidable if the following problem is undecidable: given a finite set of initial conditions for A(n), is the recurrence relation calculable? Here calculable means that for every n ≥ 0, either A(n) is an initial condition or the calculation of A(n) involves only invocations of A on arguments in \(\left\{ 0,1,\ldots,n-1\right\} \). We show that the recurrence relation
is undecidable by showing how it can be used, together with carefully chosen initial conditions, to simulate Post 2-tag systems, a known Turing complete problem.
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
Allouche, J.P., Shallit, J.: A variant of Hofstadter’s sequence and finite automata. arXiv:1103.1133v2 (2011)
Balamohan, B., Kuznetsov, A., Tanny, S.: On the behavior of a variant of Hofstadter’s Q-sequence. J. Integer Sequences 10, 29 pages (2007)
Cocke, J., Minsky, M.: Universality of tag systems with p = 2. J. ACM 11(1), 15–20 (1964)
Conway, J.H.: Unpredictable iterations. In: Proceedings of the 1972 Number Theory Confernence, pp. 49–52 (August 1972)
Cook, M.: Universality in elementary cellular automata. Complex Systems 15(1), 1–40 (2004)
Downey, P.J., Griswold, R.E.: On a family of nested recurrences. Fibonacci Quarterly 22(4), 310–317 (1984)
Golomb, S.: Discrete chaos: sequences satisfying “strange” recursions (1991) (preprint)
Hofstadter, D.R.: Gödel, Escher, Bach: An Eternal Golden Braid. Basic Books (1979)
Kubo, T., Vakil, R.: On Conway’s recursive sequence. Discrete Mathematics 152(1), 225–252 (1996)
Minsky, M.L.: Recursive unsolvability of Post’s problem of ”Tag” and other topics in theory of Turing machines. The Annals of Mathematics 74(3), 437–455 (1961)
Post, E.L.: Formal reductions of the general combinatorial decision problem. American Journal of Mathematics 65(2), 197–215 (1943)
Ruskey, F.: Fibonacci meets Hofstadter. Fibonacci Quarterly 49(3), 227–230 (2011)
Smith, A.R.: Simple computation-universal cellular spaces and self-reproduction. In: IEEE Conference Record of the 9th Annual Symposium on Switching and Automata Theory 1968, pp. 269–277 (October 1968)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Celaya, M., Ruskey, F. (2012). An Undecidable Nested Recurrence Relation. In: Cooper, S.B., Dawar, A., Löwe, B. (eds) How the World Computes. CiE 2012. Lecture Notes in Computer Science, vol 7318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30870-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-30870-3_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30869-7
Online ISBN: 978-3-642-30870-3
eBook Packages: Computer ScienceComputer Science (R0)