| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438648 | Theoretical Computer Science | 2006 | 25 Pages |
Abstract
We present deterministic polynomial time universal Turing machines (UTMs) with state-symbol pairs of (3,11), (5,7), (6,6), (7,5) and (8,4). These are the smallest known UTMs that simulate Turing machines in polynomial time.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
