User blog comment:WaxPlanck/Epsilon Function/@comment-33360606-20180219194955/@comment-30754445-20180225040809

Actually, any real-life computer architecture, when extended with infinite RAM and unlimited running time, is equivalent to a Turing Machine (up to a polynomial offset).

One does not need to specifically program (or hardwire) an actual TM into the computer for this to be true. In the mathematical sense, all computers are Turing Machine.