Undecidability of Finite Orbit Recognition in Polynomial Maps
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916017067786240 |
|---|---|
| author | Gwon, Gwangyong |
| author_facet | Gwon, Gwangyong |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_00412 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Undecidability of Finite Orbit Recognition in Polynomial Maps Gwon, Gwangyong Logic Dynamical Systems 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. |
| title | Undecidability of Finite Orbit Recognition in Polynomial Maps |
| topic | Logic Dynamical Systems |
| url | https://arxiv.org/abs/2510.00412 |