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

An RNA-based theory of natural universal computation - ScienceDirect

Introduction to Theoretical Computer Science: Equivalent models of computation

A theory of consciousness from a theoretical computer science perspective: Insights from the Conscious Turing Machine

The Stateful Automata

Turing Machines and Computability

Computability and Physics. Against Professional Philosophy

Turing Oversold

PDF) Hypercomputation and the Physical Church-Turing Thesis

From perpetual motion machines to the Entscheidungsproblem

Turing Machines (Stanford Encyclopedia of Philosophy)

JLPEA, Free Full-Text

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

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

Introduction to Theoretical Computer Science: Equivalent models of computation