From my understanding, Turing complete means that the program or machine can complete any computation that a Turing machine can complete, which to me means any computation. So how can something like HTML or PowerPoint be Turing complete?

  • $\begingroup$ How says they are? $\endgroup$ – Raphael Aug 31 '17 at 17:00
  • $\begingroup$ I don't think this question is ontopic: we are not interested in the specific capabilities of PowerPoint. Community votes, please! $\endgroup$ – Raphael Aug 31 '17 at 17:01

Some system is Turing complete if you can simulate every Turing machine inside of it. Powerpoint is Turing complete because its animation features can be used to simulate a Turing machine. This video explains the proof for Powerpoint. You can read the proceedings from the 2017 SIGBOVIK for a written explanation.

  • $\begingroup$ Could you explain more what it means to be a Turing machine? I thought that a Turing machine means any computation $\endgroup$ – a13a22 Aug 31 '17 at 13:53
  • $\begingroup$ A Turing machine is an abstract machine that looks a lot like a computer from ca 1930. Check Wikipedia $\endgroup$ – adrianN Aug 31 '17 at 14:05

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.