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

finite automata - How useful is Turing completeness? are neural nets turing complete? - Stack Overflow

Virtual Machines, Turing Completeness and the Capacity for Infinite Computation

pH Oscillating System for Molecular Computation as a Chemical Turing Machine

Turing equivalence - Life Is Computation

Is it possible to have a Turing machine that is able to build another (different) Turing machine out of purely random bits? - Quora

The Halting Problem - VoegelinView

Turing Machines – the death of formalism and the birth of computer science – TOM ROCKS MATHS

PDF) Hypercomputation and the Physical Church-Turing Thesis

Turing, von Neumann, and the computational architecture of biological machines

Applied Sciences, Free Full-Text

Turing Machines – the death of formalism and the birth of computer science – TOM ROCKS MATHS

Turing machine - Wikipedia