There are so many things wrong with this paper, and nearly all of them have to do with their &quot;proof&quot; that C is not Turing complete.<p>First off, they say that C isn&#x27;t complete because its functions for reading&#x2F;writing files are &quot;bounded&quot;. Since most other programming languages are really just implemented in C, wouldn&#x27;t that mean that either ALL programming languages aren&#x27;t Turing complete, or that C is?<p>Secondly, they mention that programming languages that have &quot;bignum&quot; types get around the &quot;bounded&quot; memory problem (because you can access &quot;infinite&quot; memory). But you can implement a bignum in C...<p>I hope this is a joke.