News for hackers. Stuff that matters.
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.
Re:The Turing Completeness of PowerPoint [video] by empath75 on Friday June 30, 2017 @07:36PM (#14674258)
If we're doing that why not just imagine a PowerPoint presentation that's not bounded?
Re:The Turing Completeness of PowerPoint [video] by Smaug123 on Saturday July 01, 2017 @04:34AM (#14676061)
Sure. PPTXTM+unbounded is to PPTXTM as C-with-integers is to C, and as Python is to Python-whose-specification-limits-it-to-boundedly-many-objects.