{"version":"1.0","type":"link","title":"Read-only Turing machine - Newikis","description":"A read-only Turing machine or two-way deterministic finite-state automaton (2DFA) is class of models of computability that behave like a standard Turing machine and can move in both directions across input, except cannot write to its input tape. The machine in its bare form is equivalent to a…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}