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