Algorithmic information theory
Algorithmic information theory
An introduction to Kolmogorov complexity and its applications
An introduction to Kolmogorov complexity and its applications
The calculi of emergence: computation, dynamics and induction
Proceedings of the NATO advanced research workshop and EGS topical workshop on Chaotic advection, tracer dynamics and turbulent dispersion
On the Length of Programs for Computing Finite Binary Sequences
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
| Hi-index | 0.00 |
Under the generic label "complexity", this chapter includes 3 related contributions of different natures. The first one (C1) is a synthetic exposition by Vincent Schächter of James P. Crutchfield's attempt [1] at a general computational representation of the notion of complexity; the second one (C2) is an account of a CeSEF-session devoted to a general discussion of this attempt; the third contribution (C3) consists of a brief note by Vincent Schächter, on the construction of complexity measures, within the framework of the method of relativized conceptualization exposed in the second part of this volume. Considered globally, the sequence indicated above should convey an illustration of the way in which, accordingly to the aim announced in the general introduction, we try to extract from modern scientific representations, methodological essences to be progressively incorporated in the researched formalized epistemology. In the following, Crutchfield is denoted by Cr.