Constructing New Families of Nested Recursions with Slow Solutions
Explore this paper's citation graph
Summary
This work applies a general method for generating a family of recursions with slow solutions from any nested recursion of the form either R(n)=R( n-s_1-R (n-a_1))+R(N-s-2-R(m-a-2)) (a two-term generalized Conolly recursion) or R(-t_1+ R(n-b_1) ( a generalized Conway recursion).
- Type
- article
- Published
- 2016-05-25
- Cited by
- 17
- References
- 0
- OpenAlex
- https://openalex.org/W2396919090
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:38351159
Keywords
Recursion (computer science), Double recursion, Combinatorics, Mathematics, Key (lock)
References
Cited by
- On Hofstadter Heart Sequences
- An exploration of nested recurrences using experimental mathematics
- On the solution space of the Golomb recursion
- On a Generalization of Hofstadter's Q-Sequence: A Family of Chaotic Generational Structures
- A New Approach to the Hofstadter Q-Recurrence
- On a conjecture about generalized Q-recurrence
- A combinatorial approach for constructing non-monotonic solutions to the generalized Golomb recursion
- Discovering linear-recurrent solutions to Hofstadter-like recurrences using symbolic computation
- On Some Solutions to Hofstadter's V-Recurrence
- On some properties of a meta-Fibonacci sequence connected to Hofstadter sequence and Möbius function
- An exploration of solutions to two related Hofstadter-Huber recurrence relations
- On Some Properties of the Hofstadter-Mertens Function
- Connecting slow solutions to nested recurrences with linear recurrent sequences
- Solutions of certain meta-Fibonacci recurrences
- A Slow Relative of Hofstadter's Q-Sequence
- Finding Linear-Recurrent Solutions to Hofstadter-Like Recurrences Using Symbolic Computation
- Altug Alkan * On a conjecture about generalized Q-recurrence