A New Approach to the Hofstadter $Q$-Recurrence
Nathan Fox

TL;DR
This paper introduces a novel method for generating new solutions to the Hofstadter Q-recurrence by focusing on initial conditions, revealing diverse and complex sequence behaviors.
Contribution
It shifts the focus from desired solutions to initial conditions, uncovering new families of solutions to nested recurrences.
Findings
Discovered new complex solutions from specific initial conditions
Revealed structured and chaotic behaviors in sequences
Expanded understanding of nested recurrence dynamics
Abstract
Nested recurrence relations are highly sensitive to their initial conditions. The best-known nested recurrence, the Hofstadter -recurrence, generates sequences displaying a wide variety of behaviors. Most famous among these is the Hofstadter -sequence, which appears to be structured at a macro level and chaotic at a micro level. Other choices of initial conditions can lead to more predictable solutions, frequently interleavings of simple sequences. Previous work has focused on the form of a desired solution and on describing an initial condition that generates such a solution. In this paper, we flip this paradigm around. We illustrate how focusing on the form of an initial condition and describing the resulting sequences can yield strange families of new solutions to nested recurrences.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · semigroups and automata theory · Algorithms and Data Compression
