Talk:Computational complexity theory: Difference between revisions

Content deleted Content added
remove spamming/canvassing altogether
Line 96:
 
I changed the introduction to be less technical and contain more applications to the "real world". I think this is more to the proposed standard. Some of the replaced material better belongs in the sections to which it pertains. I'll contribute more as I find time. [[User:Scottcraig|Scottcraig]] 18:03, 17 October 2006 (UTC)
 
== Are there really hard problems? ==
 
I published a proof that there is no proof that any decidable decision function is
not in O(n). It can even be extended to O(1).
 
Any comments? [[User:Uri Even-Chen|Uri Even-Chen]] 20:24, 21 April 2007 (UTC)
 
:Wikipedia talk pages are for discussing the article, not for discussing or promoting your research (and blogs are generally not considered [[WP:RS|reliable sources]], so that shouldn't be cited in the article); this behavior, and especially your mass posting of this is [[WP:CANVASS|canvassing]] and [[WP:SPAM|spamming]]. I have removed the link from your comment. -- [[User:Intgr|intgr]] 21:00, 21 April 2007 (UTC)