Linear Algebra is (almost) Turing Complete

Turing Machines are the classic formalization of computation, later followed by many others. In this post, I will show how to represent any Turing Machine as a nonlinear operator on an appropriate Banach space. Along the way, we’ll find interesting interpretations of things like the Halting Problem as well as connections to a cool part of Dynamical Systems theory 1 . Note: While I try to provide…