Discovering linear-recurrent solutions to Hofstadter-like recurrences using symbolic computation (Q1690783)

From MaRDI portal
Revision as of 15:43, 25 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Discovering linear-recurrent solutions to Hofstadter-like recurrences using symbolic computation
scientific article

    Statements

    Discovering linear-recurrent solutions to Hofstadter-like recurrences using symbolic computation (English)
    0 references
    0 references
    12 January 2018
    0 references
    nested recursion
    0 references
    recurrences
    0 references
    quasipolynomials
    0 references
    integer sequences
    0 references

    Identifiers