SklogWiki - User contributions [en]

User:MartinMMusatov

2009-02-24T00:11:30Z

MartinMMusatov:

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
<math>P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P</math>
== <math>P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P</math> == <math>Bohm quantum potential</math> ==P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P ==

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

[[[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

User:MartinMMusatov

2009-02-24T00:03:02Z

MartinMMusatov:

'''P = NP problem''' In pure binary, the expression and proof may be written in "real-time" (real "minus" time) explicitly:
= ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P
<math>P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P</math>
== P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P == Bohm quantum potential ==P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P ==

[[http://www.wikipedia.org/wiki/P_=_NP_problem]
Martin M. Musatov 02.24.2009

User:MartinMMusatov

2009-02-24T00:02:30Z

MartinMMusatov:

'''P = NP problem'''In pure binary, the expression and proof may be written in "real-time" (real "minus" time) explicitly:
= ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P
<math>P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P</math>
== P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P == Bohm quantum potential ==P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P ==

[[http://www.wikipedia.org/wiki/P_=_NP_problem]
Martin M. Musatov 02.24.2009

Parallel tempering

2009-02-23T23:59:37Z

MartinMMusatov:

{{Stub-general}}

P= ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P

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

--[[User:MartinMMusatov|MartinMMusatov]] 00:47, 24 February 2009 (CET)

==References==
#[http://dx.doi.org/10.1039/b509983h David J. Earl and Michael W. Deem "Parallel tempering: Theory, applications, and new perspectives", Phys. Chem. Chem. Phys. '''7''' pp. 3910 - 3916 (2005)]
[[Category: Computer simulation techniques]]

Parallel tempering

2009-02-23T23:58:53Z

MartinMMusatov:

{{Stub-general}}

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

--[[User:MartinMMusatov|MartinMMusatov]] 00:47, 24 February 2009 (CET)

==References==
#[http://dx.doi.org/10.1039/b509983h David J. Earl and Michael W. Deem "Parallel tempering: Theory, applications, and new perspectives", Phys. Chem. Chem. Phys. '''7''' pp. 3910 - 3916 (2005)]
[[Category: Computer simulation techniques]]

Parallel tempering

2009-02-23T23:58:18Z

MartinMMusatov:

{{Stub-general}}

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

--[[User:MartinMMusatov|MartinMMusatov]] 00:47, 24 February 2009 (CET)

==References==
#[http://dx.doi.org/10.1039/b509983h David J. Earl and Michael W. Deem "Parallel tempering: Theory, applications, and new perspectives", Phys. Chem. Chem. Phys. '''7''' pp. 3910 - 3916 (2005)]
[[Category: Computer simulation techniques]]

Parallel tempering

2009-02-23T23:47:41Z

MartinMMusatov:

{{Stub-general}}"P=NP may be in written "real-time" (real "minus" time) as the equation:= ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P=P = [■(&⋯&@⋮&⋱&⋮@&⋯&)] N (■(&⋯&@⋮&⋱&⋮@&⋯&)) P is an example of [[Parallel Tempering]]--[[MartinMMusatov]]--[[User:MartinMMusatov|MartinMMusatov]] 00:47, 24 February 2009 (CET)
==References==
#[http://dx.doi.org/10.1039/b509983h David J. Earl and Michael W. Deem "Parallel tempering: Theory, applications, and new perspectives", Phys. Chem. Chem. Phys. '''7''' pp. 3910 - 3916 (2005)]
[[Category: Computer simulation techniques]]

User:MartinMMusatov

2009-02-23T23:27:17Z

MartinMMusatov:

'''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>
P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P == Bohm quantum potential ==P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P ==

[[http://www.wikipedia.org/wiki/P_=_NP_problem]
Martin M. Musatov 02.24.2009

User:MartinMMusatov

2009-02-23T23:25:18Z

MartinMMusatov:

'''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]
== Bohm quantum potential ==P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P ==Martin M. Musatov 02.24.2009

User:MartinMMusatov

2009-02-23T23:24:13Z

MartinMMusatov:

'''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]
== Bohm quantum potential ==P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P ==

Martin M. Musatov 02.24.2009

User:MartinMMusatov

2009-02-23T23:21:34Z

MartinMMusatov:

'''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:

<math>P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P</math>

== Bohm quantum potential ==P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P ==

User:MartinMMusatov

2009-02-23T23:20:29Z

MartinMMusatov: 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 ⋯⋮...

'''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 ⋯⋮⋱⋮⋯ P

== Bohm quantum potential ==P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P ==