The parity-perturbed Hofstadter recursion Q(n) = Q(n-Q(n-1)) + Q(n-Q(n-2)) + (-1)^n with Q(1)=Q(2)=1 is shown to be well-defined for all n ≥ 1 via certified finite-state induction.
Order and chaos in Hofstadter’s Q-sequence.Complexity, 4(3):41–46
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Certified Finite-State Induction for a Perturbed Hofstadter Recursion
The parity-perturbed Hofstadter recursion Q(n) = Q(n-Q(n-1)) + Q(n-Q(n-2)) + (-1)^n with Q(1)=Q(2)=1 is shown to be well-defined for all n ≥ 1 via certified finite-state induction.