Can a finite physical device be Turing-equivalent? - Life Is Computation

If you believe in the following, I am going to try to change your mind: "Turing machines require unbounded memory so they cannot be physically implemented. Any physical computation device is limited in its memory capacity and, therefore, is equivalent to a finite state machine."

Your “Inner” Turing Machine?. It is not uncommon to hear the quote…, by Edoardo Contente, NeuroCollege

Mathematical and Technological Computability

The Stateful Automata

Turing Machine, PDF, Theory Of Computation

Turing Machines (Stanford Encyclopedia of Philosophy)

Turing Machines and Computability

L10b: Models of Computation

Mapping from a Turing machine to a chromatin computer. (A) Turing

Can a finite physical device be Turing-equivalent? - Life Is Computation

What does it mean to be 'Turing complete'? - Nathan Jones