2 ms·
Seems odd, given "It’s declarative and not Turing complete"
by tyingq 8y ago
Seems odd, given "It’s declarative and not Turing complete"
- TuringTest 8y agoWhat? Alan Turing also created non-universal Turing machines. :-P
- kazinator 8y agoIt's thanks to Turing that we know that a programmable machine is not Turing-complete.