Re:The Turing Completeness of PowerPoint [video]
by Smaug123 on Friday June 30, 2017 @03:44PM
(#14673198)
Logically infinite if not practically infinite. Python specifies a language which has access to logically infinite amounts of memory: it's an implementation detail that there's an upper bound on the size of tape it can simulate on a computer. PPTXTM is by design unable to simulate unbounded tapes.
[ Parent
| on HN ]
Re:The Turing Completeness of PowerPoint [video]
by Pharylon on Friday June 30, 2017 @04:32PM
(#14673458)
But by this definition, C isn't Turing Complete either.
https://cs.stackexchange.com/questions/60965/is-c-actually-t...
Re:The Turing Completeness of PowerPoint [video]
by bluGill on Friday June 30, 2017 @04:54PM
(#14673545)
When talking about Turing completeness I use an alternate definition of infinity that I call practically infinite: for a given a program that halts on an arbitrary Turing machine it also halts on this specific on. I call this practical Turing completeness (though I suspect the literature has already considered this idea and has a different term)
Re:The Turing Completeness of PowerPoint [video]
by Smaug123 on Friday June 30, 2017 @05:00PM
(#14673582)
Could you be more precise, please? I'm afraid I don't understand the definition you've given. Can you make your quantifiers explicit?
Re:The Turing Completeness of PowerPoint [video]
by bluGill on Friday June 30, 2017 @05:48PM
(#14673784)
I mean that the technical limits are a not an issue for the program you want to run. Hello World will run on an AppleII computer, but it doesn't have enough memory to run Libre Office (Assume an unlimited budget to create/port the compiler, POSIX layer, X server ...)
If the conversation is concerned with running Hello world it doesn't matter that an AppleII can't do everything, for our purposes it can do anything. If we expand the conversation a little but though we realize this machine is unable to run many things we find useful today.
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.