Sciweavers

Share
FCT   2009 Fundamentals of Computation Theory
Wall of Fame | Most Viewed FCT-2009 Paper
FCT
2009
Springer
10 years 8 days ago
Small Weakly Universal Turing Machines
We give small universal Turing machines with state-symbol pairs of (6, 2), (3, 3) and (2, 4). These machines are weakly universal, which means that they have an in´Čünitely repeate...
Turlough Neary, Damien Woods
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
IdReadViewsTitleStatus
1Download preprint from source198
2Download preprint from source191
3Download preprint from source189
4Download preprint from source171
5Download preprint from source167
6Download preprint from source160
7Download preprint from source156
8Download preprint from source146
9Download preprint from source146
10Download preprint from source145
11Download preprint from source132
12Download preprint from source131
13Download preprint from source130
14Download preprint from source126
15Download preprint from source126
16Download preprint from source117
17Download preprint from source111
18Download preprint from source110
19Download preprint from source108
20Download preprint from source107
21Download preprint from source105
22Download preprint from source105
23Download preprint from source103
24Download preprint from source86
books