What are the differences between three parts of computation?

Computability Theory is what you can compute and with what language you can compute.

Complexity Theory is what is the running time of what you can compute especially
decision problems and differentials of decision problems. All the decisions problems that
are fully decidable which means within R class are in different kind of complexity classes and
sub-classes are the domain of Complexity Theory.

Automata theory is the study of abstract machines and automata, as well as the
computational problems that can be solved using them. It is a theory in theoretical
computer science and discrete mathematics a subject of study in both mathematics and
computer science

Depends on the point of view. In many regards, Automata Theory is a sub-field of

Computational Theory. The latter being mainly concerned with the decidability and
complexity of problems, while the former offers one set of tools to approach this issue.
Others would be Formal Languages, general proofs etc. On the other hand, Automata
Theory arguably has uses outside the field of Theory of Computation. Be it in simulation,
verification and validation of actual algorithms or systems without focus on complexity.