By substituting 0 for the P value, we get P=NP by the property of identity.
Looks good to me.Post to arxiv, you need to step your publication numbers up anon. Now please solve something else before the end of next week.
>>16840477>The P versus NP problem is a major unsolved problem in theoretical computer science. Informally, it asks whether every problem whose solution can be quickly verified can also be quickly solved. I don't understand why this is such a huge problem. Isn't the world full of things that obviously constitute solutions to certain optimization problems, merely by virtue of their existence? Things that attest to their own fitness with respect to reality's complex criteria, because they logically could not exist otherwise? For example, you hardly need any computations to determine that terrestrial life solves the problem of maintaining its own structural integrity over time under terrestrial conditions, meanwhile producing such a solution involves a monumental amount of computation no matter what.
>>16840504Terrestrial life need not to be optimal in any way, only to be good enough. There are many aspects of the human anatomy that is deeply suboptimal but good enough to see a new generation brought up.
>>16840615>Terrestrial life need not to be optimal in any wayThat's not the point. They represent acceptable solutions to a myriad nontrivial computational problems, which you can deduce immediately from their mere existence. I'm sure this doesn't count for whatever reason. I'm just waiting for some compsci fag to explain why not.
