Jump to content

Forecasting complexity

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 2003:5b:ec33:4546:4c37:3a7c:8c46:68b6 (talk) at 16:49, 6 August 2017 (added two references, changed one sentence to say that "stochastic complexity" is equal to "forecasting c."). 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] Grassberger, P. (2012). "Randomness, Information, and Complexity". arXiv:arXiv:1208.3459. {{cite arXiv}}: |class= ignored (help); Check |arxiv= value (help)</ref> Funes, P. "Complexity measures for complex systems and complex objects". Retrieved 2012-08-04.</ref>

It was later renamed "statistical complexity" by Crutchfield and Young.[2][3]

References

  1. ^ Grassberger, P. (1986). "Toward a quantitative theory of self-generated complexity". International Journal of Theoretical Physics. 25: 907.
  2. ^ Crutchfield, J.; Young, Karl (1989). "Inferring statis". Physical Review Letters. 63 (2): 105. Bibcode:1989PhRvL..63..105C. doi:10.1103/PhysRevLett.63.105.
  3. ^ 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=794216055"