Results 1 
5 of
5
Small semiweakly universal Turing machines
 Machines, Computations and Universality (MCU), volume 4664 of LNCS
, 2007
"... Abstract. We present three small universal Turing machines that have 3 states and 7 symbols, 4 states and 5 symbols, and 2 states and 13 symbols, respectively. These machines are semiweakly universal which means that on one side of the input they have an infinitely repeated word, and on the other s ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
Abstract. We present three small universal Turing machines that have 3 states and 7 symbols, 4 states and 5 symbols, and 2 states and 13 symbols, respectively. These machines are semiweakly universal which means that on one side of the input they have an infinitely repeated word, and on the other side there is the usual infinitely repeated blank symbol. This work can be regarded as a continuation of early work by Watanabe on semiweak machines. One of our machines has only 17 transition rules, making it the smallest known semiweakly universal Turing machine. Interestingly, two of our machines are symmetric with Watanabe’s 7state and 3symbol, and 5state and 4symbol machines, even though we use a different simulation technique. 1.
Small weakly universal Turing machines
"... Abstract. We give small universal Turing machines with statesymbol pairs of (6, 2), (3,3) and (2,4). These machines are weakly universal, which means that they have an infinitely repeated word to the left of their input and another to the right. They simulate Rule 110 and are currently the smallest ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
Abstract. We give small universal Turing machines with statesymbol pairs of (6, 2), (3,3) and (2,4). These machines are weakly universal, which means that they have an infinitely repeated word to the left of their input and another to the right. They simulate Rule 110 and are currently the smallest known weakly universal Turing machines. Despite their small size these machines are efficient polynomial time simulators of Turing machines. 1
The complexity of small universal Turing machines: a survey
, 2007
"... We survey some work concerned with small universal Turing machines, cellular automata, tag systems, and other simple models of computation. For example it has been an open question for some time as to whether the smallest known universal Turing machines of Minsky, Rogozhin, Baiocchi and Kudlek are e ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We survey some work concerned with small universal Turing machines, cellular automata, tag systems, and other simple models of computation. For example it has been an open question for some time as to whether the smallest known universal Turing machines of Minsky, Rogozhin, Baiocchi and Kudlek are efficient (polynomial time) simulators of Turing machines. These are some of the most intuitively simple computational devices and previously the best known simulations were exponentially slow. We discuss recent work that shows that these machines are indeed efficient simulators. As a related result we also find that Rule 110, a wellknown elementary cellular automaton, is also efficiently universal. We also mention some old and new universal programsize results, including new small universal Turing machines and new weakly, and semiweakly, universal Turing machines. We then discuss some ideas for future work arising out of these, and other, results.
Tag systems and Collatzlike functions
"... Tag systems were invented by Emil Leon Post and proven recursively unsolvable by Marvin Minsky. These production systems have shown very useful in constructing small universal (Turing complete) systems for several different classes of computational systems, including Turing machines, and are thus im ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Tag systems were invented by Emil Leon Post and proven recursively unsolvable by Marvin Minsky. These production systems have shown very useful in constructing small universal (Turing complete) systems for several different classes of computational systems, including Turing machines, and are thus important instruments for studying limits or boundaries of solvability and unsolvability. Although there are some results on tag systems and their limits of solvability and unsolvability, there are hardly any that consider both the shift number v, as well as the number of symbols µ. This paper aims to contribute to research on limits of solvability and unsolvability for tag systems, taking into account these two parameters. The main result is the reduction of the 3n + 1problem to a surprisingly small tag system. It indicates that the present unsolvability line – defined in terms of µ and v – for tag systems might be significantly decreased. Key words: Tag Systems, limits of solvability and unsolvability, universality,
Internal Examiner: Dr. James Power
"... My supervisor Damien Woods deserves a special thank you. His help and guidance went far beyond the role of supervisor. He was always enthusiastic, and generous with his time. This work would not have happened without him. I would also like to thank my supervisor Paul Gibson for his advice and suppor ..."
Abstract
 Add to MetaCart
My supervisor Damien Woods deserves a special thank you. His help and guidance went far beyond the role of supervisor. He was always enthusiastic, and generous with his time. This work would not have happened without him. I would also like to thank my supervisor Paul Gibson for his advice and support. Thanks to the staff and postgraduates in the computer science department at NUI Maynooth for their support and friendship over the last few years. In particular, I would like to mention Niall Murphy he has always been ready to help whenever he could and would often lighten the mood in dark times with some rousing Gilbert and Sullivan. I thank the following people for their interesting discussions and/or advice: