3 problems

Undecidability conjecture for rapidly growing generalised polynomials
Undecidability conjecture. The first-order theory of $(\mathbb{Z};<,+,g)$ is undecidable.
opendecidability generalised-polynomials presburger-arithmetic
0 responses
04
The automaticity conjecture for generalised-polynomial sequences
Let $f\colon\mathbb{N}_0\to\Omega$ be a sequence, where $\Omega$ is a finite alphabet. Call $f$ automatic if it is generated by a finite automaton, and call it a generalised-polyno…
openautomatic-sequences combinatorics generalised-polynomials
0 responses
08
The automatic–generalised polynomial intersection conjecture
A sequence is generalised polynomial if it is obtained from polynomials by applying addition, multiplication, and the floor function, and it is ultimately periodic if it agrees wit…
openautomatic-sequences generalised-polynomials
0 responses
03

Undecidability conjecture for rapidly growing generalised polynomials