3 ms·
> 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 Turin
by embedding-shape 1mo 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 1mo agoThe imitation game (aka Turing test) has nothing to do with Turing completeness.