DOIAbstract
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
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
We present universal Turing machines with state-symbol pairs of (5, 5), (6, 4), (9, 3) and (15, 2). ...
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 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 deterministic polynomial time universal Turing machines (UTMs) with state-symbol pairs of...
AbstractWe present deterministic polynomial time universal Turing machines (UTMs) with state-symbol ...
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 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). ...
AbstractLet UTM(m, n) be the class of universal Turing machine with m states and n symbols. Universa...
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 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 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 deterministic polynomial time universal Turing machines (UTMs) with state-symbol pairs of...
AbstractWe present deterministic polynomial time universal Turing machines (UTMs) with state-symbol ...
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 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). ...
AbstractLet UTM(m, n) be the class of universal Turing machine with m states and n symbols. Universa...
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 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...
Add to ORKG