User:MartinMMusatov: Difference between revisions

Latest revision as of 02:11, 24 February 2009

P = NP, in

 pure binary,

exp

  r
   e
    s
     s
      i 
       o
        n and proof may be 
  written 
       in "real-time"

(real "minus" time)

           explicitly:

as = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P Failed to parse (syntax error): {\displaystyle P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P}

P = [■(&⋯&@⋮&⋱&⋮@&⋯&)] N (■(&⋯&@⋮&⋱&⋮@&⋯&)) P

[[P=NP]through Parallel Tempering --MartinMMusatov 01:11, 24 February 2009 (CET)Martin M. Musatov 02.24.2009

@@ 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, in
-= ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P
+  pure binary,
+exp
+   r
+    e
+     s
+      s
+       i
+        o
+         n and proof may be
+   written
+        in "real-time"
+(real "minus" time)
+            explicitly:
+as = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P
 <math>P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P</math>
-== P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P == Bohm quantum potential ==P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P ==
+== <math>P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P</math> == <math>Bohm quantum potential</math> ==P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P ==
-[[http://www.wikipedia.org/wiki/P_=_NP_problem]
+P = [■(&⋯&@⋮&⋱&⋮@&⋯&)] N (■(&⋯&@⋮&⋱&⋮@&⋯&)) P
-Martin M. Musatov 02.24.2009
+[[[http://www.wikipedia.org/wiki/P_=_NP_problem P=NP]]through [[Parallel Tempering]]
+--[[User:MartinMMusatov|MartinMMusatov]] 01:11, 24 February 2009 (CET)Martin M. Musatov 02.24.2009