4 ms·
One of the things about Turing-completeness is that it is very easy to become accidentally Turing-complete, since the conditions you need for completeness are v
by jcranmer 16d ago
One of the things about Turing-completeness is that it is very easy to become accidentally Turing-complete, since the conditions you need for completeness are very weak. (Famously, C++ template instantiation is unintentionally Turing-complete).
Z3 is an example of an accidentally Turing-complete machine.
- embedding-shape 16d ago> Z3 is an example of an accidentally Turing-complete machine. Kind of easy to let that pass though, given the "imitation game" wasn't even introduced by Turing until way after the Z3 machine was completed.
- layer8 16d agoThe imitation game (aka Turing test) has nothing to do with Turing completeness.
- tengwar2 16d agoWith the important exception of "infinite tape". That always gets forgotten.