Back to Results
First PageMeta Content



The Power of One-State Turing Machines Marzio De Biasi Jan 15, 2018 Abstract At first glance, one–state Turing machines are very weak: the Halting problem for them is decidable, and, without memory, they cannot even ac
Add to Reading List

Document Date: 2018-01-17 15:36:46


Open Document

File Size: 299,49 KB

Share Result on Facebook
UPDATE