Reachability problems in low-dimensional iterative maps
In this paper we analyze the dynamics of one-dimensional piecewise maps. We show that one-dimensional piecewise affine maps are equivalent to pseudo-billiard or so called "strange billiard" systems. We also show that use of more general classes of functions lead to undecidability of reachability problem for one-dimensional piecewise maps.
reachability problems theory of computing iterative piecewise maps pseudo-billiard systems universality