Re:The Turing Completeness of PowerPoint [video]
by Smaug123 on Friday June 30, 2017 @04:55PM
(#14673550)
I'm happy with that. It's an explicit design decision of C that there is a bound on the number of pointers. If I want to consider a Turing-complete variant, all I need to do is let pointers be of arbitrary size somehow, or let it have an "integer" type which really does hold any size of integer.
[ Parent
| on HN ]