4 citations · 4 across the 1 of their papers we have counts for
1 paper
Turlough Neary, Damien Woods
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 repeated…