Effective MC-finiteness
Abstract
An integer sequence (an)n ∈ N is MC-finite if for all m, the sequence an m is eventually periodic. There are MC-finite sequences (an)n ∈ N such that the function F: (m,n) an m is not computable. In filmus2023mc we presented concrete examples of MC-finite sequences taken from the Online Encyclopedia of Integer Sequences (OEIS) without discussing the computability of F. In this paper we discuss cases when this F is effectively computable.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.