5 ms·
That's true for any language. Computers are finite state machines, though with a lot of states, therefore no actual computer can really run a Turing complete la
by giomasce 6y ago
That's true for any language. Computers are finite state machines, though with a lot of states, therefore no actual computer can really run a Turing complete language. As many mathematical things, Turing completeness is an abstraction that doesn't really map on reality without caveats.