Linked bibliography for the SEP article "Cellular Automata" by Francesco Berto and Jacopo Tagliabue

This is an automatically generated and experimental page

If everything goes well, this page should display the bibliography of the aforementioned article as it appears in the Stanford Encyclopedia of Philosophy, but with links added to PhilPapers records and Google Scholar for your convenience. Some bibliographies are not going to be represented correctly or fully up to date. In general, bibliographies of recent works are going to be much better linked than bibliographies of primary literature and older works. Entries with PhilPapers records have links on their titles. A green link indicates that the item is available online at least partially.

This experiment has been authorized by the editors of the Stanford Encyclopedia of Philosophy. The original article and bibliography can be found here.

Miller, Page 2007 and Mitchell 2009 both contain a chapter devoted to CA: they are accessible introductions written by notable scholars. Ilachinski 2001 is an excellent starting point for the exploration of the CA literature: although not up-to-date on some technical points, the volume nicely introduces the field and covers its most important applications. Wolfram 2002 took some twenty-years and 1200 pages to be finished and is a passionate journey including bold speculations on the role of CA for understanding the universe and our place in it.

  • Batty, M., 2005, Cities and Complexity, Understanding Cities with Cellular Automata, Agent-Based Models, and Fractals, Cambridge, MA: MIT Press. (Scholar)
  • Bedau, M., 1997, “Weak Emergence,” in Philosophical Perspectives, 11: Mind, Causation, and World, J. Tomberlin (ed.), Oxford: Blackwell Publishers, pp. 375–399. (Scholar)
  • Berto, F., Rossi G., Tagliabue J., 2010, The Mathematics of the Models of Reference, London: College Publications. (Scholar)
  • Berlekamp, E., Conway J., Guy R., 1982, Winning Ways for Your Mathematical Plays, Vol. 2, London: Academic Press. (Scholar)
  • Casati, R., Varzi A., 1999, Parts and Places, Cambridge, MA: MIT Press. (Scholar)
  • Chalmers, D., 1996, The Conscious Mind, Oxford: Oxford University Press. (Scholar)
  • –––, 2002, “Strong and Weak Emergence,” in The Re-Emergence of Emergence, P. Clayton and P. Davies (eds.), Oxford: Oxford University Press, pp. 244–255. (Scholar)
  • Chen, H., Chen S., Doolen G., Lee Y.C., 1983, “Simple lattice gas models for waves,” Complex Systems, 2: 259–267. (Scholar)
  • Clark, A., 1996, Being There, Cambridge, MA: MIT Press. (Scholar)
  • Cook, M., 2004, “Universality in Elementary Cellular Automata”, Complex Systems, 15: 1–40. (Scholar)
  • Creutz, M., 1986, “Deterministic Ising dynamics,” Annals of Physics, 167: 62–76. (Scholar)
  • Crutchfield, J. P., 1994a, “The Calculi of Emergence: Computation, Dynamics, and Induction,” Physica D 75: 11–54. (Scholar)
  • –––, 1994b, “Is Anything Ever New? Considering Emergence,” in Complexity: Metaphors, Models, and Reality, G. Cowan, D. Pines, D. Melzner (eds.), SFI Series in the Sciences of Complexity XIX, Redwood City, CA: Addison-Wesley, pp. 479-497. (Scholar)
  • Crutchfield, J. P. , Hanson J. E., 1993, “Turbulent Pattern Bases for Cellular Automata,” Physica D 69: 279–301. (Scholar)
  • Crutchfield, J. P., Mitchell M., 1995, “The evolution of emergent computation,” Proceedings of the National Academy of Sciences, 92(23): 10742. (Scholar)
  • Dennett, D., 1991, “Real Patterns”, Journal of Philosophy, 88: 27–51. (Scholar)
  • –––, 2003, Freedom Evolves, New York: Viking Penguin. (Scholar)
  • Hedlund, G.A., 1969, “Endomorphisms and Automorphisms of the Shift Dynamical System”, Mathematical Systems Theory, 3: 51–59. (Scholar)
  • Epstein, J.M., 1999, “Agent-based computational models and generative social science,” Complexity, 4(5):41–60. (Scholar)
  • Feynman, R. P., The Character of Physical Law, Cambridge, MA: MIT Press.
  • Franceschetti, D. R., Campbell B. W., Hamneken J. W., 1992, “Hamming nets, Ising sets, cellular automata, neural nets and random walks,” American Journal of Physics, 61: 50–53. (Scholar)
  • Fredkin, E., Toffoli T., 1982, “Conservative logic,” International Journal of Theoretical Physics, 21:219–253. (Scholar)
  • Fredkin, E., 1990, “Digital Mechanics: An Information Process Based on Reversible Universal Cellular Automata,” Physica D, 45:254–270. (Scholar)
  • –––, 1993, “A New Cosmogony,” in PhysComp '92: Proceedings of the Workshop on Physics and Computation, IEEE Computer Society Press, pp. 116–121. (Scholar)
  • Gell-Mann, M., 1994, The Quark and the Jaguar, New York: W.H. Freeman and Company. (Scholar)
  • Hanson, J. E., Crutchfield J. P., 1992, “The Attractor-Basin Portrait of a Cellular Automaton,” Journal of Statistical Physics, 66: 1415–1462. (Scholar)
  • Hordijk, W., Crutchfield J. P., Mitchell M., 1996, “Embedded Particle Computation in Evolved Cellular Automata,” in Proceedings of the Conference on Physics and Computation. (Scholar)
  • Ilachinski, A., 2001, Cellular Automata, Singapore: World Scientific Publishing. (Scholar)
  • Ingerson, T.E., and R.L. Buvel, 1984, “Structure in asynchronous cellular automata,” Physica D 10:59–68. (Scholar)
  • Kauffman, S., 1984, “Emergent properties in random complex automata,” Physica D 10: 145–156. (Scholar)
  • Kim, J., 1999, “Making Sense of Emergence,” Philosophical Studies, 95: 3–36. (Scholar)
  • Land, M., Belew R., 1995, “No Perfect Two-State Cellular Automata for Density Classification Exist”, Physical Review Letters, 74: 1548–1550. (Scholar)
  • Landauer, R., 1961, “Irreversibility and Heat Generation in the Computing Process”, IBM Journal of Research and Developmen, 5: 183–191. (Scholar)
  • Langton, C., 1990, “Computation at the Edge of Chaos: Phase Transitions and Emergent Computation,” Physica D, 42:12–37. (Scholar)
  • Lee, T.D., 1986, “Solutions of Discrete Mechanics Near the Continuum Limit,” in Rationale of Being, K. Ishikawa et al. (eds.), Singapore: World Scientific Publishing. (Scholar)
  • Lewis, D., 1973, Counterfactuals, Oxford: Blackwell Publishers. (Scholar)
  • –––, 1994, “Humean Supervenience Debugged,” Mind, 103: 473–490. (Scholar)
  • Miller, J., Page S., 2007, Complex Adaptive System, Princeton: Princeton University Press. (Scholar)
  • Mitchell, M., 1998, An Introduction to Genetic Algorithms, Cambridge, MA: MIT Press. (Scholar)
  • –––, 2009, Complexity: A Guided Tour, Oxford: Oxford University Press. (Scholar)
  • Mitchell, M., Crutchfield J. P., Das R., 1996, “Evolving Cellular Automata with Genetic Algorithm: A Review of Recent Works,” in Proceedings of the First International Conference on Evolutionary Computation and Its Applications, Russian Academy of Science. (Scholar)
  • Mitchell, M., Hraber P. T., Crutchfield J. P., 1994, “Revisiting the Edge of Chaos: Evolving Cellular Automata to Perform Computations,” Complex Systems, 7: 89–130. (Scholar)
  • Moore, C., “Recursion Theory on the Reals and Continuous-Time Computation,” Theoretical Computer Science, 162: 23–44. (Scholar)
  • Moore, E. F., 1962, “Machine Models of Self-Reproduction”, Proceedings of Symposia in Applied Mathematics , 14: 17–33. (Scholar)
  • Myhill, J., 1963, “The Converse of Moore's Garden-of-Eden Theorem”, Proceedings of the American Mathematical Society, 14: 685–686. (Scholar)
  • Packard, N., 1988, “Adaptation toward the Edge of Chaos,” in Dynamic Patterns in Complex Systems, J.A.S. Kelso, A.J. Mandell and M.F. Schlesinger (eds.), Singapore: World Scientific Publishing, pp. 293–301. (Scholar)
  • Poincaré, H., 1914, Science and Method, New York: Nelsons and Sons. (Scholar)
  • Putnam, H., 1988, Representation and Reality, Cambridge, MA: MIT Press. (Scholar)
  • Richards, F., Meyer T., Packard N., 1990, “Extracting Cellular Automaton Rules Directly from Experimental Data,” Physica D, 45:189–202. (Scholar)
  • Searle, J. R., 1992, The Rediscovery of the Mind, Cambridge: MIT Press. (Scholar)
  • Svozil, K., 1987, “Are Quantum Fields Cellular Automata?,” Physics Letters, 119: 153–6. (Scholar)
  • Teller, P., 1992, “A Contemporary Look at Emergence,” in Emergence or Reduction?, A. Beckermann, H. Flohr and J. Kim (eds.), Berlin: Walter de Gruyter. (Scholar)
  • Thompson, E., 2007, Mind in Life. Biology, Phenomenology, and the Sciences of Mind, Cambridge: Harvard University Press. (Scholar)
  • Toffoli, Т., 1977, “Computation and Construction Universality of Reversible Cellular Automata”, Journal of Computer and System Science, 15: 213. (Scholar)
  • Turing, A., 1936, “On Computable Numbers with an Application to the Entscheideungproblem,” Proceeding of the London Mathematical Society, 42: 230–265. (Scholar)
  • Von Neumann, J., 1951, “The General and Logical Theory of Automata,” in Cerebral Mechanisms in Behavior: The Hixon Symposium, New York: John Wiley & Sons. (Scholar)
  • Wheeler, J.A., 1990, “Information, Physics, Quantum: The Search for Links,” in Complexity, Entropy, and the Physics of Information, W. Zurek (ed.), Boston: Addison-Wesley. (Scholar)
  • Wolfram, S., 1983, “Statistical Mechanics of Cellular Automata,” Reviews of Modern Physics, 55: 601–644. (Scholar)
  • –––, 2002, A New Kind of Science, Champaign, IL: Wolfram Media. (Scholar)
  • Zuse, K., 1982, “The Computing Universe,” International Journal of Theoretical Physics, 21: 589–600. (Scholar)

Generated Wed Mar 22 12:08:45 2017