Re:Surprisingly Turing-Complete
by gwern on Friday October 02, 2015 @09:57PM
(#10322308)
> You can deduce formulas for every single step of the process, just like with CSS!
You can deduce the formulas, but can you make the formulas self-deducing when driven only by a mechanical clock like a steady mouse-click? Or will it require constant adjustment and intervention by the operator?
> But I'm sure we can all agree that this is not Turing completeness
I'm not sure we can. TC can be tricky. That's why people try to give constructions rather than just claim something or other is TC.
You can deduce the formulas, but can you make the formulas self-deducing when driven only by a mechanical clock like a steady mouse-click? Or will it require constant adjustment and intervention by the operator?
> But I'm sure we can all agree that this is not Turing completeness
I'm not sure we can. TC can be tricky. That's why people try to give constructions rather than just claim something or other is TC.