According to the Church$-$Turing thesis, which of the following statements is true?

a$)$ Any computable function can be computed by a Turing machine

b$)$ Any computable function can be computed by a quantum computer

c$)$ Any computable function can be computed in polynomial time

d$)$ Any computable function can be computed by a finite automaton