| |
| | Nonlinear Dynamics and Complex Systems Theory (Glossary) (Site not responding. Last check: 2007-10-22) |
 | | The Computational Complexity of a problem is defined as the time it takes for the fastest program running on a universal computer -as measured in number of computing steps, say N -to compute the solution to the problem. |
 | | Intuitively, complexity is usually greatest in systems whose components are arranged in some intricate difficult-to-understand pattern or, in the case of a dynamical system, when the outcome of some process is difficult to predict from its initial state. |
 | | A dynamical system is usually defined as a continuous flow, that is (1) is completely defined at all times by the values of N variables -x1(t), x2(t),..., xN(t), where xi(t) represents any physical quantity of interest, and (2) its temporal evolution is specified by an autonomous system of N, possibly coupled, ordinary first-order differential equations. |
| www.cna.org /isaac/Glossb.htm (8566 words) |
|