HackerPapers

arXiv:1208.3459physics.data-an

Randomness, Information, and Complexity

Peter Grassberger

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

Abstract

We review possible measures of complexity which might in particular be applicable to situations where the complexity seems to arise spontaneously. We point out that not all of them correspond to the intuitive (or "naive") notion, and that one should not expect a unique observable of complexity. One of the main problems is to distinguish complex from disordered systems. This and the fact that complexity is closely related to information requires that we also give a review of information measures. We finally concentrate on quantities which measure in some way or other the difficulty of classifying and forecasting sequences of discrete symbols, and study them in simple examples.

arXiv comments
Reprinted version of a paper that appeared first in Proc. 5th Mexican School on Statistical Physics, Oaxtepec 1989, with errors corrected and footnotes added. When citing, please cite the original publication and the present arXiv version
Journal reference
DOI
Subjects
physics.data-anData Analysis, Statistics and Probability

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Oct 2016 to Oct 2016. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.