 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Is anything known about the time complexity characteristics of symmetric Turing machines? — Preceding unsigned comment added by 82.26.4.127 (talk) 17:21, 21 February 2013 (UTC)
- They're easily seen to be equivalent to nondeterministic TMs in that case, see Theorem 9 of Lewis,Papadimitriou. Tokenzero (talk) 17:27, 22 April 2014 (UTC)