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

What is Classical Computer Science, and What are its Boundaries? – Theoretical and Foundational Problems (TFP) in Information Studies

Introduction to Theoretical Computer Science: Equivalent models of computation

pH Oscillating System for Molecular Computation as a Chemical Turing Machine

Entropy, Free Full-Text

Introduction to Theoretical Computer Science: Loops and infinity

Turing Oversold

Computation

Toward a formal theory for computing machines made out of whatever physics offers

Chapter 2 Dawson Draft Book