I really think that P can be equal to NP, just the algorithm can be very chaothic, based on pseudonumber generators, and very-hard-to-analyze emerging behaviour

I really think that P can be equal to NP, just the algorithm can be very chaothic, based on pseudonumber generators, and very-hard-to-analyze emerging behaviour. For others to have an initial 'feeling' on this, I've created a polynomial time algorithm which tries to find N/2 cliques in a graph: It is already true for this quite simple algorithm that analyzing the correctness of the algorithm is harder than creating the algorithm itself: http://nadamhu.wordpress.com/2010/08/12/the-good-guys-and-bad-guys-algorithm/ http://nadamhu.wordpress.com/2010/08/12/the-good-guys-and-ba...