Smooth Maps of the Interval and the Real Line Capable of Universal Computation
We construct two classes of maps: once-differentiable maps of the unit interval which can simulate a wide variety of operations on sequences, including cellular automata, generalized shifts, and Turing machines; and analytic maps of $R$ which simulate Turing machines. This brings down the dimensionality in which a smooth dynamical system can be computationally universal from 2 [1] to 1.