Which of the following statements about Turing machines is false?

a$)$ Turing machines can simulate any algorithmic process.

b$)$ Turing machines are equivalent in power to deterministic finite automata.

c$)$ Turing machines have an infinite tape and a finite set of states.

d$)$ Turing machines can be used to prove whether a problem is undecidable.