Thingamabob：创建页面，内容为“复杂性科学涵盖面极其广泛，为了方便对此领域感兴趣的学者能够快速地熟悉复杂性科学的历史、了解到复杂性可学的发展脉…”

2020-10-14T13:26:17Z

创建页面，内容为“复杂性科学涵盖面极其广泛，为了方便对此领域感兴趣的学者能够快速地熟悉复杂性科学的历史、了解到复杂性可学的发展脉…”

新页面

复杂性科学涵盖面极其广泛，为了方便对此领域感兴趣的学者能够快速地熟悉复杂性科学的历史、了解到复杂性可学的发展脉络，在此收集了若干复杂性科学经典读物的列表。欢迎大家一起来补充。

==Santa Fe研究所推荐的25篇经典论文==

Foundational Papers in Complexity Science

Last Revision: October 22, 2009 (From Santa Fe’s Institute’s website)
[http://www.santafe.edu/library/foundational-papers-complexity-science/]

中英对照目录

# Waddington, C.H. 1942. Canalization of Development and the Inheritance of Acquired Characters. Nature 150:563-565 (沃丁顿. 1942. 渠化的发展与后天性状的遗传. 自然150:563-565 )
# Rosenblueth, A., and N. Wiener. 1945. The Role of Models in Science. Philosophy of Science 12 (4):316-321. (罗森布鲁斯和维纳. 1945. 模型在科学中的作用. 科学哲学12（4）:316 - 321.)
# Shannon, C.E. 1948. A Mathematical Theory of Communication. Bell System Technical Journal 27:379-423 623-656. (香农. 1948. 通信的数学理论. 贝尔技术期刊27:379-423 623 - 656.)
# Turing, A.M. 1950. Computing Machinery and Intelligence. Mind, New Series, 59 (236):433-460. (图灵. 1950. 计算机和智能. 思维59（236）:433 - 460.)
# Turing, A.M. 1952. The Chemical Basis of Morphogenesis. Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences 237 (641):37-72. (图灵. 1952. 形态发生的化学基础. 伦敦皇家学会哲学汇刊. B辑，生物科学237（641）:37-72.)
# Minksy, M. 1961. Steps Toward Artificial Intelligence. Proceedings of the Institute of Radio Engineers 49 (1):8-30. (明斯基. 1961. 走向人工智能. 无线电工程研究所通讯49（1）:8 - 30.)
# Landauer, R. 1961. Irreversibility and Heat Generation in the Computing Process. IBM Journal of Research and Development 5:183-191. (兰道尔. 1961. 计算的不可逆性和热过程. IBM研发期刊5:183 - 191.)
# Arrow, K.J. 1962. The Economic Implications of Learning by Doing. Review of Economic Studies 80:155-173. (阿罗. 1962. 实践习得的经济学启示. 经济研究评论80:155 - 173.)
# Kolmogorov, A.N. 1965. Three Approaches to the Quantitative Definition of Information. Problems of Information and Transmission 1 (1):1-7. (柯尔莫哥洛夫. 1965. 信息的三种量化界定方法。信息与传输问题1（1）:1 - 7.)
# Raup, D.M. 1966. Geometric Analysis of Shell Coiling; General Problems. Journal of Paleontology 40 (5):1178-1190. (拉普. 1966. 贝壳卷曲的一般几何分析.古生物40（5）:1178 - 1190.)
# Neumann, J. V. 1966. Theory of Self-Reproducing Automata. In Theory of Self-Reproducing Automata, edited by A. W. Burks. Urbana: University of Illinois Press. Original edition, Fourth University of Illinois lecture. (冯诺依曼. 1966. 细胞自动机的自复制理论. 《细胞自动机的自复制理论》.伯克. 伊利诺伊大学出版.)
# Chaitin, G.J. 1966. On the Length of Programs for Computing Finite Binary Sequences. Journal of the ACM 13:547-569. (蔡廷. 1966. 可计算有限二进制序列的程序的长度。计算机学会会刊13:547 - 569.)
# Anderson, P.W. 1972. More Is Different. Science, New Series 177 (4047):393-396. (安德森. 1972. 多即不同. 科学177（4047）:393 - 396.)
# Conant, Roger C. and W. Ross Ashby. 1970. Every Good Regulator of a System Must be a Model of That System. International Journal of Systems Science 1 (2):89-97.(罗杰和阿什比. 1970. 系统的良好调节器即该系统的模型. 国际系统科学杂志1（2）:89 - 97.)
# Simon, H. 1973. The Organization of Complex Systems. In Hierarchy Theory, edited by H. H. Pattee. New York: George Braziller. (西蒙. 1973. 复杂系统的组织. 《层次理论》帕蒂. 纽约：乔治Braziller出版社.)
# Bennett, C.H. 1973. Logical Reversibility of Computation. IBM Journal of Research and Development 17 (6):525-532. (贝内特. 1973.计算的逻辑可逆性. IBM研发期刊17（6）:525 – 532.)
# Smith, J.M. 1974. The theory of games and the evolution of animal conflicts. Journal of Theoretical Biology 47 (1):209-21. (史密斯. 1974. 博弈理论与动物冲突的进化. 理论生物学47（1）:209 - 21)
# May, R.M. 1976. Simple Mathematical Models with Very Complicated Dynamics. Nature 261 (5560):459-67. (梅. 1976. 简单的数学模型可导致非常复杂的动力学. 自然261（5560）:459 - 67)
# Holland, J.H., and J.S. Reitman. 1977. Cognitive Systems Based on Adaptive Algorithms. SIGART Newsletter (63):49. (霍兰和雷特曼. 1977. 基于适应性算法的认知系统. SIGART通讯（63）：49)
# Gould, S.J., and N. Eldredge. 1977. Punctuated Equilibria: the Tempo and Mode of Evolution Reconsidered. Paleobiology 3 (2):115-151. (古尔德和埃尔德雷奇. 1977. 间断的平衡：进化的步伐及模式的再思考. 古生物学3（2）:115 – 151.)
# Hopfield, J.J. 1982. Neural Networks and Physical Systems with Emergent Collective Computational Abilities. Proceedings of the National Academy of Sciences, USA 79:2554-2558. (霍普菲尔. 1982. 可涌现集体计算能力的神经网络和物理系统. 美国国家科学院院刊 79:2554-2558)
# Wolfram, S. 1984. Universality and Complexity in Cellular Automata. Physica D 10:1-35. (沃尔弗拉姆. 1984. 细胞自动机的普遍性和复杂性. 物理学D辑 10:1-35.)
# Langton, C.G. 1986. Studying Artificial Life with Cellular Automata. Physica D: Nonlinear Phenomena 22 (1-3):120-149. (朗顿. 1986. 研究人工生命与细胞自动机. 物理学D辑 22（1-3）:120 – 149.)
# Derrida, B., E. Gardner, and A. Zippelius. 1987. An exactly solvable asymmetric neural network model. Europhysics Letters 4 (2):167-173. (德里达和齐佩利乌斯. 1987. 一个完全可解的非对称神经网络模型. 欧洲物理学通讯4（2）:167 – 173.)
# Gell-Mann, Murray and Seth Lloyd. 2003. Effective Complexity. Santa Fe Institute Working Paper #03-12-069. (盖尔曼和劳埃德. 2003. 有效的复杂性. 圣塔菲研究所的工作文件＃03-12-069.)

计算士整理了一个rar文件，搜集了这个书单中的大部分论文，可以在这里下载到[http://www.swarma.org/download.php?id=208]

==复杂网络研究的经典文献==

# Barabási, Albert-László and Réka Albert, Emergence of scaling in random networks, Science, 286:509-512, October 15, 1999 这篇文章首次发现了互联网的无标度现象，并提出了著名的BA无标度网络模型。
# Watts, Duncan J.; Strogatz, Steven H., Collective dynamics of 'small-world' networks. Nature 393 (6684): 440–442, June 1998 这篇文章首次发现了复杂网络的小世界现象，并提出了著名的WS小世界网络模型。

{{reply}}
[[Category:旧词条迁移]]

复杂性科学经典论文 - 版本历史

Thingamabob：创建页面，内容为“复杂性科学涵盖面极其广泛，为了方便对此领域感兴趣的学者能够快速地熟悉复杂性科学的历史、了解到复杂性可学的发展脉…”