3 ms·
Sure, in the same way that all of our computers (and by extension languages running on them) are also finite state machines and are as such not Turing complete.
by lxgr 1y ago
Sure, in the same way that all of our computers (and by extension languages running on them) are also finite state machines and are as such not Turing complete.