User:MartinMMusatov: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
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: = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P | ||
<math>P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P</math>[[http://www.wikipedia.org/wiki/P_=_NP_problem]P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P] | |||
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: = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P | == Bohm quantum potential ==P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P ==Martin M. Musatov 02.24.2009 | ||
<math>P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P</math> | |||
[[http://www.wikipedia.org/wiki/P_=_NP_problem]P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P] | |||
== Bohm quantum potential ==P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P == | |||
Martin M. Musatov 02.24.2009 | |||
Revision as of 00:25, 24 February 2009
P = NP problemIn pure binary, the expression and proof P=NP must be written in "real-time" (real "minus" time) and is explicitly given by the equation: = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P Failed to parse (syntax error): {\displaystyle P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P} [[1]P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P] == Bohm quantum potential ==P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P ==Martin M. Musatov 02.24.2009