3 papers
cs.CC2026
Correspondences in computational and dynamical complexity II: forcing complex reductions
Samuel Everett
An algebraic telic problem is a decision problem in formalizing finite-time reachability questions for one-dimensional dynamical systems. We prove that the…
math.DS2026
Correspondences in computational and dynamical complexity I
Samuel Everett
We begin development of a method for studying dynamical systems using concepts from computational complexity theory. We associate families of decision problems, called telic proble…
math.DS2024
A piecewise contractive map on triangles
Samuel Everett
We study the dynamics of a piecewise map defined on the set of three pairwise nonparallel, nonconcurrent lines in . The geometric map of study may be analogized to th…