Okay then, show me a proof that you can simulate an arbitrary Turing machine with C. Because the addressable memory is finite, there are a few consequences, and the languages described by C are smaller than that of a Turing Machine. This is not pedantry; the purpose for a Turing Machine is to have a precise mathematical model we can use to describe languages and the types of problems they can solve. If we're just going to throw around whose purpose is to be precise in definition and use them incorrectly, what's the point in even talking about Turing machines? Why bring up Turing completeness in the first place? Python, C++, Haskell, and many other languages manage to be Turing complete, but C does not. And yet C is one of the most widely used languages, even to this date. What I meant by my comment was a side note to kind of illuminate this fact, because I find it pretty cool. You don't need a complex Turing-complete language for it to be good. C was written with reality in mind.