Revision as of 06:32, 26 November 2007 edit Walkerma (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 22,243 edits To be included in Version 0.7, though history section needs work ← Previous edit		Revision as of 05:42, 18 December 2007 edit undo Doradus (talk \| contribs) Extended confirmed users, Pending changes reviewers 6,033 edits →What machine model?: new section Next edit →
Line 144: This page could use some history - in particular it ought to reference Juris Hartmanis and Richard Stearns' "On the Computational Complexity of Algorithms". It already cites a reference with some history. I can help with this. [[User:Dcoetzee\|Dcoetzee]] 03:02, 18 August 2007 (UTC) == What machine model? == What kind of machine is used to measure the number of steps or amount of memory required to solve a problem? A [[Random access stored program machine\|RASP machine]]? I don't think it's a [[Turing machine]]. --[[User:P3d0\|P3d0]] ([[User talk:P3d0\|talk]]) 05:42, 18 December 2007 (UTC)

Talk:Computational complexity theory: Difference between revisions