DOIAbstract
AbstractLet UTM(m, n) be the class of universal Turing machine with m states and n symbols. Universal Turing machines are proved to exist in the following classes: UTM(24,2), UTM(10,3), UTM(7,4), UTM(5,5), UTM(4,6), UTM(3,10) and UTM(2,18)
AbstractLet UTM(m, n) be the class of universal Turing machine with m states and n symbols. Universal Turing machines are proved to exist in the following classes: UTM(24,2), UTM(10,3), UTM(7,4), UTM(5,5), UTM(4,6), UTM(3,10) and UTM(2,18)
Key words: small universal Turing machine, polynomial time, universality. Abstract. We present a num...
We give small universal Turing machines with state-symbol pairs of (6,2), (3,3) and (2,4). These mac...
We present deterministic polynomial time universal Turing machines (UTMs) with state-symbol pairs of...
AbstractLet UTM(m, n) be the class of universal Turing machine with m states and n symbols. Universa...
We present deterministic polynomial time universal Turing machines (UTMs) with state-symbol pairs of...
We present deterministic polynomial time universal Turing machines (UTMs) with state-symbol pairs of...
We present deterministic polynomial time universal Turing machines (UTMs) with state-symbol pairs of...
AbstractWe present deterministic polynomial time universal Turing machines (UTMs) with state-symbol ...
We present three small universal Turing machines that have 3 states and 7 symbols, 4 states and 5 sy...
We present three small universal Turing machines that have 3 states and 7 symbols, 4 states and 5 sy...
We give small universal Turing machines with state-symbol pairs of (6,2), (3,3) and (2,4). These mac...
We present universal Turing machines with state-symbol pairs of (5, 5), (6, 4), (9, 3) and (15, 2). ...
We present universal Turing machines with state-symbol pairs of (5, 5), (6, 4), (9, 3) and (15, 2). ...
We present universal Turing machines with state-symbol pairs of (5, 5), (6, 4), (9, 3) and (15, 2). ...
Abstract. We present two small universal Turing machines that have 3 states and 7 symbols, and 4 sta...
Key words: small universal Turing machine, polynomial time, universality. Abstract. We present a num...
We give small universal Turing machines with state-symbol pairs of (6,2), (3,3) and (2,4). These mac...
We present deterministic polynomial time universal Turing machines (UTMs) with state-symbol pairs of...
AbstractLet UTM(m, n) be the class of universal Turing machine with m states and n symbols. Universa...
We present deterministic polynomial time universal Turing machines (UTMs) with state-symbol pairs of...
We present deterministic polynomial time universal Turing machines (UTMs) with state-symbol pairs of...
We present deterministic polynomial time universal Turing machines (UTMs) with state-symbol pairs of...
AbstractWe present deterministic polynomial time universal Turing machines (UTMs) with state-symbol ...
We present three small universal Turing machines that have 3 states and 7 symbols, 4 states and 5 sy...
We present three small universal Turing machines that have 3 states and 7 symbols, 4 states and 5 sy...
We give small universal Turing machines with state-symbol pairs of (6,2), (3,3) and (2,4). These mac...
We present universal Turing machines with state-symbol pairs of (5, 5), (6, 4), (9, 3) and (15, 2). ...
We present universal Turing machines with state-symbol pairs of (5, 5), (6, 4), (9, 3) and (15, 2). ...
We present universal Turing machines with state-symbol pairs of (5, 5), (6, 4), (9, 3) and (15, 2). ...
Abstract. We present two small universal Turing machines that have 3 states and 7 symbols, and 4 sta...
Key words: small universal Turing machine, polynomial time, universality. Abstract. We present a num...
We give small universal Turing machines with state-symbol pairs of (6,2), (3,3) and (2,4). These mac...
We present deterministic polynomial time universal Turing machines (UTMs) with state-symbol pairs of...
Add to ORKG