Background Readings CCSSS13: Difference between revisions
From Santa Fe Institute Events Wiki
No edit summary |
No edit summary |
||
(4 intermediate revisions by 3 users not shown) | |||
Line 4: | Line 4: | ||
For more readings, please explore the wiki content of previous summer schools. | For more readings, please explore the wiki content of previous summer schools. | ||
'''[https://www.dropbox.com/sh/sgws7bsemslsjc4/u77Z-50r35 Here is a Dropbox folder with PDFs of all the papers below.]''' | |||
<br> | |||
[http://chd.ucsd.edu/seminar/documents/waddington.nature.pdf Waddington, C.H. 1942. Canalization of Development and the Inheritance of Acquired Characters. Nature 150:563-565.] | [http://chd.ucsd.edu/seminar/documents/waddington.nature.pdf Waddington, C.H. 1942. Canalization of Development and the Inheritance of Acquired Characters. Nature 150:563-565.] | ||
Line 29: | Line 35: | ||
[http://www.google.com/url?sa=t&source=web&ct=res&cd=1&ved=0CBIQFjAA&url=http%3A%2F%2Fciteseerx.ist.psu.edu%2Fviewdoc%2Fdownload%3Fdoi%3D10.1.1.7.5156%26rep%3Drep1%26type%3Dpdf&ei=7CIFTOPUOKaUMs6t2Ts&usg=AFQjCNG2hWyC8HdDNVeOIWa6ZA9xKL9xZA&sig2=v-kyVrQVEvjz3GpnWcz93A Chaitin, G.J. 1966. On the Length of Programs for Computing Finite Binary Sequences. Journal of the ACM 13:547-569.] | [http://www.google.com/url?sa=t&source=web&ct=res&cd=1&ved=0CBIQFjAA&url=http%3A%2F%2Fciteseerx.ist.psu.edu%2Fviewdoc%2Fdownload%3Fdoi%3D10.1.1.7.5156%26rep%3Drep1%26type%3Dpdf&ei=7CIFTOPUOKaUMs6t2Ts&usg=AFQjCNG2hWyC8HdDNVeOIWa6ZA9xKL9xZA&sig2=v-kyVrQVEvjz3GpnWcz93A Chaitin, G.J. 1966. On the Length of Programs for Computing Finite Binary Sequences. Journal of the ACM 13:547-569.] | ||
[http:// | [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.161.3702&rep=rep1&type=pdf 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.] | ||
[http://www.google.com/url?sa=t&source=web&ct=res&cd=1&ved=0CBYQFjAA&url=http%3A%2F%2Fwww.sccs.swarthmore.edu%2Fusers%2F08%2Fbblonder%2Fphys120%2Fdocs%2Fanderson.pdf&ei=siMFTOmRLZPCM5iwxTs&usg=AFQjCNHMcFgAnJg_ngtqQsYX2Zu6t0iUiw&sig2=rGqMQ39VsWndCh4JxqK-Yg Anderson, P.W. 1972. More Is Different. Science, New Series 177 (4047):393-396.] | [http://www.google.com/url?sa=t&source=web&ct=res&cd=1&ved=0CBYQFjAA&url=http%3A%2F%2Fwww.sccs.swarthmore.edu%2Fusers%2F08%2Fbblonder%2Fphys120%2Fdocs%2Fanderson.pdf&ei=siMFTOmRLZPCM5iwxTs&usg=AFQjCNHMcFgAnJg_ngtqQsYX2Zu6t0iUiw&sig2=rGqMQ39VsWndCh4JxqK-Yg Anderson, P.W. 1972. More Is Different. Science, New Series 177 (4047):393-396.] | ||
[http:// | [http://link.springer.com/chapter/10.1007/978-94-010-9521-1_14 Simon, H. 1973. The Organization of Complex Systems. In Hierarchy Theory, edited by H. H. Pattee. New York: George Braziller.] | ||
[http://webout.weizmann.ac.il/complex/tlusty/courses/InfoInBio/Papers/Bennett1973.pdf Bennett, C.H. 1973. Logical Reversibility of Computation. IBM Journal of Research and Development 17 (6):525-532.] | [http://webout.weizmann.ac.il/complex/tlusty/courses/InfoInBio/Papers/Bennett1973.pdf Bennett, C.H. 1973. Logical Reversibility of Computation. IBM Journal of Research and Development 17 (6):525-532.] | ||
Line 49: | Line 55: | ||
[http://www.stephenwolfram.com/publications/articles/ca/84-universality/ Wolfram, S. 1984. Universality and Complexity in Cellular Automata. Physica D 10:1-35.] | [http://www.stephenwolfram.com/publications/articles/ca/84-universality/ Wolfram, S. 1984. Universality and Complexity in Cellular Automata. Physica D 10:1-35.] | ||
[http:// | [http://deepblue.lib.umich.edu/handle/2027.42/26022 Langton, C.G. 1986. Studying Artificial Life with Cellular Automata. Physica D: Nonlinear Phenomena 22 (1-3):120-149.] | ||
[http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.130.1431&rep=rep1&type=pdf Derrida, B., E. Gardner, and A. Zippelius. 1987. An exactly solvable asymmetric neural network model. Europhysics Letters 4 (2):167-173.] | [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.130.1431&rep=rep1&type=pdf Derrida, B., E. Gardner, and A. Zippelius. 1987. An exactly solvable asymmetric neural network model. Europhysics Letters 4 (2):167-173.] |
Latest revision as of 19:43, 8 November 2013
Chile Complex Systems Summer School 2013 |
The following is a collection of papers regarded as "classic" literature in Complex Systems Science. This list has been growing over the past few years and was formalized by Dan Rockmore for the 2010 Complex Systems Summer School.
For more readings, please explore the wiki content of previous summer schools.
Here is a Dropbox folder with PDFs of all the papers below.
Turing, A.M. 1950. Computing Machinery and Intelligence. Mind, New Series, 59 (236):433-460.
Anderson, P.W. 1972. More Is Different. Science, New Series 177 (4047):393-396.
May, R.M. 1976. Simple Mathematical Models with Very Complicated Dynamics. Nature 261 (5560):459-67.
Wolfram, S. 1984. Universality and Complexity in Cellular Automata. Physica D 10:1-35.
Last Updated for SFI CSSS12 May 25 2012