Physical portrayal of computational complexity

Details Physical portrayal of computational complexity Physical portrayal of computational complexity

2009-06-05

arxiv.org/abs/0906.1084v1

ISRN Computational Mathematics 2012 ID: 321372, 1-15

Computer Science

Computational Complexity

16, pages, 7 figures

Scientific paper

10.5402/2012/321372

Computational complexity is examined using the principle of increasing entropy. To consider computation as a physical process from an initial instance to the final acceptance is motivated because many natural processes have been recognized to complete in non-polynomial time (NP). The irreversible process with three or more degrees of freedom is found intractable because, in terms of physics, flows of energy are inseparable from their driving forces. In computational terms, when solving problems in the class NP, decisions will affect subsequently available sets of decisions. The state space of a non-deterministic finite automaton is evolving due to the computation itself hence it cannot be efficiently contracted using a deterministic finite automaton that will arrive at a solution in super-polynomial time. The solution of the NP problem itself is verifiable in polynomial time (P) because the corresponding state is stationary. Likewise the class P set of states does not depend on computational history hence it can be efficiently contracted to the accepting state by a deterministic sequence of dissipative transformations. Thus it is concluded that the class P set of states is inherently smaller than the set of class NP. Since the computational time to contract a given set is proportional to dissipation, the computational complexity class P is a subset of NP.

Affiliated with

Also associated with

No associations

Rating

Physical portrayal of computational complexity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Physical portrayal of computational complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Physical portrayal of computational complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-522294