Re:Accidentally Turing-Complete
by waynecochran on Friday April 24, 2020 @09:00AM
(#22967464)
Turing Complete is not a very high bar. Add a second stack to a pushdown automata and its Turing Complete. Add two counters to a NFA and it’s Turing Complete. I am not sure if folks know what this means.
[ Parent
| on HN ]
Yes. Judging from the HN discussion of a very similar list a week ago, a loud minority confuses “not Turing complete” with “sandboxed”. Hence lots of discussions about security that seem to miss the point.