Jump to content

Forecasting complexity

From Wikipedia, the free encyclopedia
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

Forecasting complexity is a measure of complexity put forward (under the original name of) by the physicist Peter Grassberger.[1][2][3]

It was later renamed "statistical complexity" by James P. Crutchfield and Karl Young.[4][5]

References

  1. ^ Grassberger, P. (1986). "Toward a quantitative theory of self-generated complexity". International Journal of Theoretical Physics. 25 (9): 907–938. Bibcode:1986IJTP...25..907G. doi:10.1007/bf00668821. S2CID 16952432.
  2. ^ Grassberger, P. (2012). "Randomness, Information, and Complexity". arXiv:1208.3459 [physics].
  3. ^ Funes, P. "Complexity measures for complex systems and complex objects". Retrieved 2012-08-04.
  4. ^ Crutchfield, J.; Young, Karl (1989). "Inferring statistical complexity". Physical Review Letters. 63 (2): 105–108. Bibcode:1989PhRvL..63..105C. doi:10.1103/PhysRevLett.63.105. PMID 10040781.
  5. ^ Shalizi, C. R. (2006). "Methods and Techniques of Complex Systems Science: An Overview". arXiv:nlin/0307015.