17298 search results - page 207 / 3460 » Abstract computing machines |
144
click to vote
FCT
2009
Springer
15 years 10 months ago
2009
Springer
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 infinitely repeate...
137
click to vote
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
We show that 2-tag systems efficiently simulate Turing machines. As a corollary we find that the small universal Turing machines of Rogozhin, Minsky and others simulate Turing ma...
119
click to vote
ANOR
2008
15 years 3 months ago
2008
Abstract We consider the following scheduling setting: a set of
121
click to vote
IJCSS
2000
15 years 3 months ago
2000
Abstract. During the machining process of a complex rotating pro