A Turing machine is the most complete machine, if something is computable it can be done by a Turing machine.
A Turing complete machine is a machine who can make the same as a Turing Machine. The cellphone in which I write this, the computer you have, they are Turing complete models.
An finite automaton it’s not, it can’t recognise palindromes, for example.
Latest Answers