The complexity of small universal Turing machines (2007)
Cached
Download Links
- [www.bcri.ucc.ie]
- [www.cs.ucc.ie]
- [www.dna.caltech.edu]
- DBLP
Other Repositories/Bibliography
by
Turlough Neary
,
Damien Woods
| Venue: | Computability in Europe 2007, volume 4497 of LNCS |
| Citations: | 7 - 3 self |
BibTeX
@INPROCEEDINGS{Neary07thecomplexity,
author = {Turlough Neary and Damien Woods},
title = {The complexity of small universal Turing machines},
booktitle = {Computability in Europe 2007, volume 4497 of LNCS},
year = {2007},
pages = {791--798},
publisher = {CIE, Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We present small polynomial time universal Turing machines with state-symbol pairs of (5, 5), (6, 4), (9, 3) and (18, 2). These machines simulate our new variant of tag system, the bi-tag system and are the smallest known universal Turing machines with 5, 4, 3 and 2-symbols respectively. Our 5-symbol machine uses the same number of instructions (22) as the smallest known universal Turing machine by Rogozhin. 1
