Correspondences in computational and dynamical complexity II: forcing complex reductions

Samuel Everett

An algebraic telic problem is a decision problem in ${\text{NP}}_{\mathbb{R}}$ formalizing finite-time reachability questions for one-dimensional dynamical systems. We prove that the…