![](https://www.pdfsearch.io/img/d096d72450ee1b05e8db7682acabca6c.jpg) Date: 2018-01-17 15:36:46
| | 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 acAdd to Reading ListSource URL: www.nearly42.orgDownload Document from Source Website File Size: 299,49 KBShare Document on Facebook
|