P = NP, in the factorization of all odd number.

See: http://www.ijma.info Vol 6 (9) 2015

]]>:arrow: :star: :idea: :!: fyi a quick summary/ overview of some striking new results maybe eventually touching the area & its all just begging for some hardcore mathematicians to jump into the *fray*: arithmetic circuit complexity, Valiants VP=?VNP, recent advances/ breakthroughs, new directions :D :cool:

elsewhere more on P vs NP as a “math monster/ everest/ olympus mons”

]]>I think I have an equation solution for the problem, would you like to read it?

Sincerely yours,

Jasper

Could I have your opinion about this point of view?

http://the-point-of-view-of-frank.blogspot.com/2012/08/p-versus-up.html

]]>Diagonalisation and randomisation are both ways to achieve the same purpose, namely to avoid an unwanted collision (or, in the language of the above analogy, to avoid the student ever “getting lucky” and finding the correct URL by accident). The underlying intuition (that finding a (randomly or diagonally selected) needle in an exponentially large haystack should be a very computationally difficult task) is probably more important here than the specific tool used to formalise that intuition.

]]>I still cannot seem to get my head around the idea that showing that two objects (viz. complexity classes) are not equal under some “transformation” is