2 ms·
it can carry out a fixed sequence of operations, but it can't do arbitrary computation This is incorrect. The Z3 is Turing-complete, as has been shown by Raúl
by kleiba 6y ago
it can carry out a fixed sequence of operations, but it can't do arbitrary computation
This is incorrect. The Z3 is Turing-complete, as has been shown by Raúl Rojas in 1998 [1]. It requires some hacking though.
[1] https://ieeexplore.ieee.org/document/707574 https://ieeexplore.ieee.org/document/707574
- twic 6y agoThat is a cool paper (and there is an unpaywalled PDF [1]), but what that it shows is not that the Z3 is Turing complete, but that a larger machine comprising a Z3 and a piece of sticky tape is Turing complete. The Z3 as built and used was not Turing complete. Moreover, the technique in the paper is purely a stunt. You couldn't do practical branching computation that way. It is definitely cool, but it doesn't change the fact that the Z3 was a calculator, not a computer. [1] http://www.inf.fu-berlin.de/inst/ag-ki/rojas_home/documents/1997/Universal_Computer.pdf http://www.inf.fu-berlin.de/inst/ag-ki/rojas_home/documents/...