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."

Turing machine - Wikipedia

An Introduction to the Theory of Computation: The Church-Turing Thesis

The Halting Problem - VoegelinView

Turing Machine, PDF, Theory Of Computation

L10b: Models of Computation

L10b: Models of Computation

Frontiers Living Things Are Not (20th Century) Machines: Updating Mechanism Metaphors in Light of the Modern Science of Machine Behavior

Computation

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

Computability and Physics. Against Professional Philosophy

Trains are Turing complete I think? : r/factorio

Difference between Finite Automata and Turing Machine - GeeksforGeeks

Applied Sciences, Free Full-Text