Undecidability of Finite Orbit Recognition in Polynomial Maps

Gwangyong Gwon

公開日: 2025/10/1

Abstract

We prove the undecidability of determining whether a Turing machine yields an eventually periodic trajectory. From this, we deduce the undecidability of orbit finiteness in the polynomial dynamical system on infinite tuples of integers.

Undecidability of Finite Orbit Recognition in Polynomial Maps | SummarXiv | SummarXiv