5 ms·
Unfortunate about the performance. A side question I have is whether or not this is Turing complete given the lack of looping and recursion possible (at least i
by grenoire 7y ago
Unfortunate about the performance. A side question I have is whether or not this is Turing complete given the lack of looping and recursion possible (at least in this example). The author defines each iteration 'manually.'
- Dylan16807 7y agoI say no, by far. The ability to add and multiply is "Turing complete" if you add external looping. Or in this case, the ability to XOR and NOT. But nobody is going to click on "SVG/CSS/HTML is arithmetic-complete". Or "ring-complete".
- fourthark 7y agoI hope the author made a mistake and didn't make a false claim for clicks.
- Dylan16807 7y agoI won't accuse them of doing it on purpose when many other people have made essentially the same claim. "Turing complete" is a somewhat vague term that is tricky to evaluate in certain contexts.