An approach to the physics of complexity (Q1321728): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0960-0779(94)90021-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1986113702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measures of complexity. Proceedings of the conference, held in Rome, September 30 - October 2, 1987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information and self organization. A macroscopic approach to complex systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3673103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3956799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5632131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algebraic measure of complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a quantitative theory of self-generated complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5617439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some equivalences between Shannon entropy and Kolmogorov complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolution mechanisms in self-reproducing systems. II / rank
 
Normal rank

Latest revision as of 15:22, 22 May 2024

scientific article
Language Label Description Also known as
English
An approach to the physics of complexity
scientific article

    Statements

    An approach to the physics of complexity (English)
    0 references
    0 references
    29 March 1995
    0 references
    On the basic representation of complex systems by probabilistic weighted, connected directed acyclic graphs the author discusses Zipf's law and the possibility of obtaining the critical complexities for the evolution of complex systems. The speculation for the critical complexity per feature in respect to the chance to preserve the minimal hierarchical structure of the complex system gives \(C_ 0 = 2^{-1} \ln 2 \pi e^ 2 \sim 2,77\) bit per feature. An exact analytic treatment later gives the value \(C_ 0 = \pi^ 2/(6 \ln 2) \sim 2,37\) bit per feature.
    0 references
    0 references
    probabilistic weighted, connected directed acyclic graphs
    0 references
    Zipf's law
    0 references
    critical complexities
    0 references
    evolution of complex systems
    0 references
    minimal hierarchical structure
    0 references
    0 references