User:MartinMichaelMusatov

From Qwiki

My name is Martin M. Musatov. You may view some of my work at NewMedici.com. I have been researching Complexity Classes, for an academic paper on P=NP, and have formulated the following equations:

== P = ⋯⋮⋱⋮⋯ N ⋯⋮⋱⋮⋯ P P = [■(&⋯&@⋮&⋱&⋮@&⋯&)] N (■(&⋯&@⋮&⋱&⋮@&⋯&)) P A = [■(&⋯&@⋮&⋱&⋮@&⋯&)] N (■(&⋯&@⋮&⋱&⋮@&⋯&)) \P MartinMichaelMusatov 07:04, 24 February 2009 (UTC)

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

My theorem is that P=NP may simply be a succinct problem. An example of a succinct problem being a problem we instinctively know the solution to but have not the means to succinctly express it due to barrier in language or altered logical approach to the application of the solution.

To remedy this barrier, a perhaps proper solution to the P=NP problem, in pure binary, if you'll allow the term, may require a written in a "real-time" (real "minus" time) formulation, as to match the complete model of a Turing machine, and to process information as it is received, as a linear function or computable stream. To achieve this it may be necessary to formulate any solution with the cardinality of a live system clock.

I have my first "Polynomial Time" rendering of the first equation live at the address: [1]--MartinMichaelMusatov 06:57, 24 February 2009 (UTC)