| Contents |
| Switching systems are an example of non-autonomous dynamical systems, which
are well-known in control theory as instances of programmed (or closed loop)
control systems. We will discuss the relation between the complexity of the
control sequences (as measured by the topological entropy of the control
sequence generator) and the complexity of the resulting dynamics (as
measured by its topological entropy). We will bring our result in connection
with the so-called Parrondo's paradox in other areas of science. |
|