Complexity Through Nonextensivity

@inproceedings{Bialek2001ComplexityTN,
  title={Complexity Through Nonextensivity},
  author={William Bialek and Ilya Nemenman and Naftali Tishby},
  year={2001}
}
The problem of de,ning and studying complexity of a time series has interested people for years. In the context of dynamical systems, Grassberger has suggested that a slow approach of the entropy to its extensive asymptotic limit is a sign of complexity. We investigate this idea further by information theoretic and statistical mechanics techniques and show that these arguments can be made precise, and that they generalize many previous approaches to complexity, in particular, unifying ideas… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 36 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Int

  • P. Grassberger
  • J. Theor. Phys. 25
  • 1986
Highly Influential
9 Excerpts

Bell Sys

  • C. E. Shannon
  • Tech. J. 27
  • 1948
Highly Influential
7 Excerpts

in: B

  • N. Tishby, F. Pereira, W. Bialek
  • Hajek, R.S. Sreenivas (Eds.), Proceedings of the…
  • 1999
1 Excerpt

Neural Comput

  • V. Balasubramanian
  • 9
  • 1997

Inf

  • J. Rissanen, IEEE Trans
  • Theory 42
  • 1996
3 Excerpts

P

  • T. Schurmann
  • Grassberger, Chaos 6
  • 1996

Phys

  • W. Bialek, C. Callan, S. Strong
  • Rev. Lett. 77
  • 1996
1 Excerpt

T

  • W. Ebeling
  • PW oschel, Europhys. Lett. 26
  • 1994
1 Excerpt

Zurek (Ed.), Complexity, Entropy and the Physics of Information, Addison-Wesley

  • C. Bennett, in W.H
  • Redwood City,
  • 1990
1 Excerpt

Similar Papers

Loading similar papers…