Matches in DBpedia 2016-04 for { ?s ?p "A symmetric Turing machine is a Turing machine which has a configuration graph that is undirected (that is, configuration i yields configuration j if and only if j yields i)."@en }
Showing triples 1 to 4 of
4
with 100 triples per page.
- Symmetric_Turing_machine abstract "A symmetric Turing machine is a Turing machine which has a configuration graph that is undirected (that is, configuration i yields configuration j if and only if j yields i).".
- Q7661303 abstract "A symmetric Turing machine is a Turing machine which has a configuration graph that is undirected (that is, configuration i yields configuration j if and only if j yields i).".
- Symmetric_Turing_machine comment "A symmetric Turing machine is a Turing machine which has a configuration graph that is undirected (that is, configuration i yields configuration j if and only if j yields i).".
- Q7661303 comment "A symmetric Turing machine is a Turing machine which has a configuration graph that is undirected (that is, configuration i yields configuration j if and only if j yields i).".