Algorithmic Social Sciences Research Unit
暂无分享,去创建一个
[1] W S McCulloch,et al. A logical calculus of the ideas immanent in nervous activity , 1990, The Philosophy of Artificial Intelligence.
[2] A. Turing. On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .
[3] L. Loeb. Autobiographical Notes , 2015, Perspectives in biology and medicine.
[4] Carlos Gershenson,et al. Reinventing the Sacred: A New View of Science, Reason, and Religion. Stuart A. Kauffman. (2008, Basic Books.) $27. , 2009, Artificial Life.
[5] J. Harnad. The trouble with Physics: The rise of string theory, the fall of a Science, and what comes next , 2008 .
[6] P. Woit. Not even wrong : the failure of string theory and the continuing challenge to unify the laws of physics , 2006 .
[7] S. Barry Cooper,et al. Definability as hypercomputational effect , 2006, Appl. Math. Comput..
[8] S. Barry Cooper,et al. How Can Nature Help Us Compute? , 2006, SOFSEM.
[9] Peter Wegner,et al. The Church-Turing Thesis: Breaking the Myth , 2005, CiE.
[10] S. Cooper,et al. The Incomputable Alan Turing , 2004, 1206.1706.
[11] D. Friedan. A Tentative theory of large distance physics , 2002, hep-th/0204131.
[12] Jon Rigelsford,et al. Behaviour‐based Robotics , 2001 .
[13] A. Whitaker. The Fabric of Reality , 2001 .
[14] A. Damasio. The feeling of what happens , 2001 .
[15] R. Brooks. The relationship between matter and life , 2001, Nature.
[16] R. V. Jean,et al. A History of the Study of Phyllotaxis , 1997 .
[17] B. Jack Copeland,et al. On Alan Turing's anticipation of connectionism , 1996, Synthese.
[18] R. Sorkin,et al. Spacetime as a Causal Set , 1989 .
[19] P. Smolensky. On the proper treatment of connectionism , 1988, Behavioral and Brain Sciences.
[20] Sandy Lovie. How the mind works , 1980, Nature.
[21] F. Takens,et al. On the nature of turbulence , 1971 .
[22] A. M. Turing,et al. The chemical basis of morphogenesis , 1952, Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences.
[23] Emil L. Post. Recursively enumerable sets of positive integers and their decision problems , 1944 .
[24] S. Barry Cooper,et al. Computability and Emergence , 2006 .
[25] Carlo Cellucci,et al. MATHEMATICAL LOGIC: WHAT HAS IT DONE FOR THE PHILOSOPHY OF MATHEMATICS? , 2005 .
[26] P. Odifreddi,et al. Incomputability in Nature , 2003 .
[27] David Thomas,et al. The Art in Computer Programming , 2001 .
[28] S. Cooper. Models and Computability: Clockwork or Turing U/universe? - Remarks on Causal Determinism and Computability , 1999 .
[29] Jean-Baptiste Lully,et al. The collected works , 1996 .
[30] Robin Milner,et al. Elements of interaction: Turing award lecture , 1993, CACM.
[31] G. Kreisel. Church's Thesis: A Kind of Reducibility Axiom for Constructive Mathematics , 1970 .
[32] T. Kuhn. The Structure of Scientific Revolutions 2nd edition , 1970 .
[33] H. Rogers,et al. Some Problems of Definability in Recursive Function Theory , 1967 .