User:MartinMMusatov: Difference between revisions
Jump to navigation
Jump to search
(New page: '''P = NP problem''' In pure binary, the expression and proof P=NP must be written in "real-time" (real "minus" time) and is explicitly given by the equation: P = ⋯⋮⋱⋮⋯ N ⋯⋮...) |
No edit summary |
||
| Line 1: | Line 1: | ||
'''P = NP problem''' | '''P = NP problem''' | ||
In pure binary, the expression and proof P=NP must be written in "real-time" (real "minus" time) and is explicitly given by the equation: | In pure binary, the expression and proof P=NP must be written in "real-time" (real "minus" time) and is explicitly given by the equation: | ||
P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P | <math>P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P</math> | ||
== Bohm quantum potential ==P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P == | == Bohm quantum potential ==P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P == | ||
Revision as of 01:21, 24 February 2009
P = NP problem
In pure binary, the expression and proof P=NP must be written in "real-time" (real "minus" time) and is explicitly given by the equation:
Failed to parse (syntax error): {\displaystyle P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P}