  We show that there is no Curtis-Hedlund-Lyndon Theorem for factor maps
between tiling dynamical systems: there are codes between such systems which
cannot be achieved by working within a finite window. By considering
1-dimensional tiling systems, which are the same as flows under functions on
subshifts with finite alphabets of symbols, we construct a `simple' code which
is not `local', a local code which is not simple, and a continuous code which
is neither local nor simple.
