论文信息 - Algorithmic Complexity and Spatial Simplicity

Algorithmic Complexity and Spatial Simplicity

Recently the field of complexity science has emerged as an amalgamation of many different areas borrowing ideas and attracting researchers from the physical, biological and social sciences (Holland 1992; Bak 1996; Kohonen 1997; Fabian 1998; Wolfram 1994; Kauffman 2000). Of late, much of this interdisciplinary research has been facilitated by ideas and tools borrowed from another field, namely, computer science.

[1] R. Stough,et al. Measuring Similarity Among Various Shapes Based on Geometric Matching , 2005 .

[2] Gregory J. Chaitin,et al. Randomness in Arithmetic , 1988 .

[3] Gregory J. Chaitin,et al. On the Length of Programs for Computing Finite Binary Sequences , 1966, JACM.

[4] W. H. Zurek. Complexity, Entropy and the Physics of Information , 1990 .

[5] Per Bak,et al. How Nature Works , 1996 .

[6] Gregory J. Chaitin,et al. Information, Randomness and Incompleteness , 1987 .

[7] Ming Li,et al. An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[8] L. Waller,et al. Exploring Goodness‐of‐Fit and Spatial Correlation Using Components of Tango's Index of Spatial Clustering , 2005 .

[9] Gregory J. Chaitin,et al. Algorithmic Information Theory , 1987, IBM J. Res. Dev..

[10] Ray J. Solomonoff,et al. The Discovery of Algorithmic Probability , 1997, J. Comput. Syst. Sci..

[11] Roger R. Stough,et al. Traffic Grammar and Algorithmic Complexity in Urban Freeway Flow Patterns , 2007 .

[12] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[13] T. G. Bergin,et al. The New Science , 1962 .

[14] Teuvo Kohonen,et al. Self-Organizing Maps , 2010 .

[15] Gregory. J. Chaitin,et al. Algorithmic information theory , 1987, Cambridge tracts in theoretical computer science.