Saved in:
Bibliographic Details
Main Authors: Filmus, Yuval, Fischer, Eldar, Makowsky, Johann A.
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2502.10212
Tags: Add Tag
No Tags, Be the first to tag this record!
Table of Contents:
  • An integer sequence $(a_n)_{n \in \mathbb{N}}$ is \emph{MC-finite} if for all $m$, the sequence $a_n \bmod m$ is eventually periodic. There are MC-finite sequences $(a_n)_{n \in \mathbb{N}}$ such that the function $F: (m,n) \mapsto a_n \bmod m$ is not computable. In \cite{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.