Assertion: turing machine | /r/CapableOf | simulate rule 110 cellular automaton
Facets:
Source sentences:
text: Small weakly universal Turing machines that simulate the Rule 110 cellular automaton have been given for the (6, 2), (3, 3), and (2, 4) state-symbol pairs.