Jump to content

Forecasting complexity

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Bibcode Bot (talk | contribs) at 16:04, 12 September 2017 (Adding 0 arxiv eprint(s), 1 bibcode(s) and 0 doi(s). Did it miss something? Report bugs, errors, and suggestions at User talk:Bibcode Bot). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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: 907. Bibcode:1986IJTP...25..907G. doi:10.1007/bf00668821.
  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 statis". Physical Review Letters. 63 (2): 105. Bibcode:1989PhRvL..63..105C. doi:10.1103/PhysRevLett.63.105.
  5. ^ Shalizi, C. R. (2006). "Methods and Techniques of Complex Systems Science: An Overview". arXiv:nlin/0307015. {{cite arXiv}}: |class= ignored (help)


Stub icon

This applied mathematics–related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Forecasting_complexity&oldid=800288714"