This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics articles
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)Reply
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)Reply
