2010/03/30 by Carlos Gershenson, Gershenson, Carlos
Computer Science · Mathematics · #Adaptation and Self-Organizing Systems (nlin.AO) #Benford’s Law and Fraud Detection #Chaos, Complexity, and Education #Computability, Logic, AI Algorithms #F.1.3 #FOS: Physical sciences
paper · pdf · doi:10.48550/arxiv.1003.5947
openalex publication_date 2010/03/30 · openalex created_date 2024/04/11 · openalex updated_date 2026/07/28
There is no single definition of complexity (Edmonds 1999; Gershenson 2008; Mitchell 2009; De Domenico, et al., 2019), as it acquires different meanings in different contexts. A general notion is the amount of information required to describe a phenomenon (Prokopenko, et al. 2008) , but it can also be understood as the length of the shortest program required to compute that description, as the time required to compute that description, as the minimal model to statistically describe a phenomenon, etc.