Continuous automata theory holds promise to become a powerful generalization of discrete automata theory, but so far the work has barely gotten off the ground. I'll describe what I think are the most important unsolved problems and future directions for research, mentioning plenty of examples and a few preliminary results. Specific topics may include nondeterminism, continuous regular expressions, non-smooth automata, interpretations of hybrid automata, and continuous Turing machines.