Content deleted Content added
m Assessed as "B" for WikiProject Computer science via script |
Are there really hard problems? |
||
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). [http://www.speedy.net/uri/blog/?p=19]
Any comments? [[User:Uri Even-Chen|Uri Even-Chen]] 20:24, 21 April 2007 (UTC)
| |||