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…
cs.CR2024
On the use of dynamical systems in cryptography
Samuel Everett
Ever since the link between nonlinear science and cryptography became apparent, the problem of applying chaotic dynamics to the construction of cryptographic systems has gained a b…