Hi people, Recently I checked some problems in mathematics, computer science and physics. For a long time I had the intuition that the P vs NP Problem is an undecidable problem. I think the only conclusion we have is that there is no solution, I don't think P and NP are mathematically well defined. The definition has to take itself into the equation, otherwise it leads to a contradiction. I was trying to check whether it is possible to generate a mathematical proof that any problem is hard. I came to a conclusion that such a proof doesn't exist. A few days ago, 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).
You can see my proof here: http://www.speedy.net/uri/blog/?p=19 If you are interested in the rest of the articles, they are here: http://www.speedy.net/uri/blog/?m=200704 Best Regards, Uri Even-Chen ================================================================= To unsubscribe, send mail to [EMAIL PROTECTED] with the word "unsubscribe" in the message body, e.g., run the command echo unsubscribe | mail [EMAIL PROTECTED]
