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

LM101-075: Can computers think? A Mathematician's Response using a Turing Machine Argument (remix) - %

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

Computing the Uncomputable: [Joel David] Hamkins showed there's a Turing machine that [] can compute the uncomputable but only in some weird alternative universe where the natural numbers aren't what we think

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

Computability and Physics. Against Professional Philosophy

Introduction to Theoretical Computer Science: Loops and infinity

Introduction to Theoretical Computer Science: Equivalent models of computation

It's possible to build a Turing machine within Magic: The Gathering

Turing Machines and Computability

Stupidity from our old friend Sal

PDF) Hypercomputation and the Physical Church-Turing Thesis

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

Turing Machines (Stanford Encyclopedia of Philosophy)

Turing Machine, PDF, Theory Of Computation

From perpetual motion machines to the Entscheidungsproblem