Sure, in the same way that all of our computers (and by extension languages runn...

		lxgr 3 months ago \| parent \| context \| favorite \| on: Memory access is O(N^[1/3]) 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.