We give several criteria of complexity and define different universality classes. According to our classification, at the lowest class of complexity are random graph, Markov Models and Hidden Markov Models. At the next level is Sherrington-Kirkpatrick spin glass, connected with neuron-network models. On a higher level are critical theories, spin glass phase of Random Energy Model, percolation, self organized criticality (SOC). The top level class involves HOT design, error threshold in optimal coding, language, and, maybe, financial market. Alive systems are also related with the last class.
CITATION STYLE
Saakian, D. B. (2011). Universality classes of complexity. In Unifying Themes in Complex Systems (pp. 289–295). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-17635-7_35
Mendeley helps you to discover research relevant for your work.