Theoretical Computer Science

Automata Theory is the study of abstract machines and the problems they can solve.

Computational complexity theory studies the resources needed for algorithms to solve problems.