Research Article

Physical Portrayal of Computational Complexity

Figure 4

A circuit (O) containing nodes with degrees of freedom ( 𝑛 3 ) represents an NFA. The computation steps from a state to another when currents are driven from the input instance (top) down along alternative but interdependent paths toward the output acceptance (bottom). Since the currents affect each other by affecting the driving forces, the circuit corresponds to the NFA having a power set of states. It can be decomposed to the distinct circuits (A–E), one member for each conceivable current without additional degrees of freedom, that are representing an array of DFAs each having at most a polynomial set of states.
321372.fig.004