On: A Solution of the P versus NP Problem?

[naturalgradient]

Don't forget the case where P == 0

[dom0 → naturalgradient]

You're both wrong.

P is the union of all TIME complexity classes defined by n^k for every natural k.

NP is the union of all NTIME complexity classes defined by n^k for every natural k.