Revision as of 09:44, 28 January 2012 edit Abhay Parvate (talk \| contribs) 16 edits →Probabilistic Turing Machine: new section ← Previous edit		Revision as of 09:53, 28 January 2012 edit undo Abhay Parvate (talk \| contribs) 16 edits Removed my question. The two concerned pages are clear enough. Next edit →
Line 459: "When considering complexity the problem should be presented in an abstract form, so that each concrete representation may be transformed into the same problem." <small><span class="autosigned">— Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[User:Thepigdog\|Thepigdog]] ([[User talk:Thepigdog\|talk]] • [[Special:Contributions/Thepigdog\|contribs]]) 08:06, 12 October 2011 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--> ~~== Probabilistic Turing Machine ==~~ The subsection "Turing machine" in this article says "A probabilistic Turing machine is a '''deterministic''' Turing machine with an extra supply of random bits" (emphasis mine), whereas the main article "Probabilistic Turing Machine" says "[it] is a '''non-deterministic''' Turing machine which ...". Can someone resolve this conflict? Thanks. [[User:Abhay Parvate\|Abhay Parvate]] ([[User talk:Abhay Parvate\|talk]]) 09:44, 28 January 2012 (UTC)

Talk:Computational complexity theory: Difference between revisions