Woods, Damien and Neary, Turlough (2006) Remarks on the computational complexity of small universal Turing machines. In: Proceedings Of The Fourth International Conference On Information And The Fourth Irish Conference On The Mathematical Foundations Of Computer Science And Information Technology Mfcsit, 2006.
|
Download (89kB)
| Preview
|
Abstract
This paper surveys some topics in the area of small universal Turing machines and tag systems. In particular we focus on recent results concerning the computational complexity of such machines.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Keywords: | small universal Turing machines; polynomial time; tag systems; |
| Academic Unit: | Faculty of Science and Engineering > Computer Science Faculty of Science and Engineering > Research Institutes > Hamilton Institute |
| Item ID: | 15738 |
| Depositing User: | Damien Woods |
| Date Deposited: | 28 Mar 2022 13:12 |
| Journal or Publication Title: | MFCSIT: Fourth Irish Conference on the Mathematical Foundations of Computer Science and Information Technology |
| Publisher: | UCC |
| Refereed: | Yes |
| URI: | |
| Use Licence: | This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here |
Repository Staff Only(login required)
 |
Item control page |
Downloads
Downloads per month over past year
Altmetric
Altmetric