Theoretical computer science
Computability theory and Computational complexity theory look at the question if a problem can be solved by a given automaton, and how well a given solution is, compared to others.