I will survey a few basic definitions and results which generalize the classical theory of finite automata to the world of continuous time and topological monoid actions. The goal will be to state an (unsurprisingly) negative result expressing the difficulty of simulating a continuous automaton, even compact, with a finite state automaton. Depending on time and audience interest, I may sketch a proof of this or other results.