3 ms·
A practical definition of Turing complete is any language that can exercise the full capabilities of the computer. Given any two languages can do so then they
by mybrid 10y ago
A practical definition of Turing complete is any language that can exercise the full capabilities of the computer.
Given any two languages can do so then they are in fact, interchangeable.