Physical portrayal of computational complexity

DOI10.5402/2012/321372MaRDI QIDQ408483zbMATH OpenOpenAlexWikidataFDO

Publication date 10 April 2012

Published in ISRN Computational Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.5402/2012/321372

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Summary: 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 information requires physical representations and because many natural processes complete in nondeterministic polynomial time (NP). The irreversible process with three or more degrees of freedom is found intractable when, in terms of physics, flows of energy are inseparable from their driving forces. In computational terms, when solving a problem in the class NP, decisions among alternatives will affect subsequently available sets of decisions. Thus the state space of a nondeterministic finite automaton is evolving due to the computation itself, hence it cannot be efficiently contracted using a deterministic finite automaton. Conversely when solving problems in the class P, the 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 state set of class P is inherently smaller than the state set of class NP. Since the computational time needed to contract a given set is proportional to dissipation, the computational complexity class P is a proper (strict) subset of NP.

Recommendations

Cites work

Cited in

(7)

Describes a project that uses

Uses Software

Concorde

This page was built for publication: Physical portrayal of computational complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408483)