Date Added: Oct 2011
In this paper, the authors propose to use probabilistic complexity theory, which is also known as the foundation of modern cryptography, to study very complex systems in the form of large-scale self-organizing networks. A very complex system is typically probabilistic and stochastic in its nature. In such a system, it is impossible to describe every system behavior in a deterministic manner. They have to adopt a probabilistic framework. Like what is advocated by modern cryptographers, in regard to an input metric x measuring the operational algorithms being studied (Figure 1), such as security attacks and countermeasures, they speak of the "Feasibility or infeasibility" of breaking the system rather than the "Possibility or impossibility" of breaking the same system.