David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Minds and Machines 4 (4):439-449 (1995)
A wide range of systems appear to perform computation: what common features do they share? I consider three examples, a digital computer, a neural network and an analogue route finding system based on soap-bubbles. The common feature of these systems is that they have autonomous dynamics — their states will change over time without additional external influence. We can take advantage of these dynamics if we understand them well enough to map a problem we want to solve onto them. Programming consists of arranging the starting state of a system so that the effects of the system''s dynamics on some of its variables corresponds to the effects of the equations which describe the problem to be solved on their variables. The measured dynamics of a system, and hence the computation it may be performing, depend on the variables of the system we choose to attend to. Although we cannot determine which are the appropriate variables to measure in a system whose computation basis is unknown to us I go on to discuss how grammatical classifications of computational tasks and symbolic machine reconstruction techniques may allow us to rule out some measurements of a system from contributing to computation of particular tasks. Finally I suggest that these arguments and techniques imply that symbolic descriptions of the computation underlying cognition should be stochastic and that symbols in these descriptions may not be atomic but may have contents in alternative descriptions
|Keywords||Computation dynamics symbolic-dynamics cognition neural-networks|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
David H. Ackley, Geoffrey E. Hinton & Terrence J. Sejnowski (1985). A Learning Algorithm for Boltzmann Machines. Cognitive Science 9 (1):147-169.
Werner Heisenberg (1958). Physics and Philosophy;. New York,Harper.
Jaakko Hintikka (1977). Quantifiers in Natural Languages: Some Logical Problems II. [REVIEW] Linguistics and Philosophy 1 (2):153 - 172.
Robert W. Kentridge (2001). Computation, Chaos and Non-Deterministic Symbolic Computation: The Chinese Room Problem Solved? Psycoloquy 12 (50).
Citations of this work BETA
No citations found.
Similar books and articles
David J. Chalmers (2011). A Computational Foundation for the Study of Cognition. Journal of Cognitive Science 12 (4):323-357.
David J. Chalmers (1994). On Implementing a Computation. Minds and Machines 4 (4):391-402.
Kazuyuki Aihara & Jun Kyung Ryeu (2001). Chaotic Neurons and Analog Computation. Behavioral and Brain Sciences 24 (5):810-811.
Drew McDermott (2001). The Digital Computer as Red Herring. Psycoloquy 12 (54).
Ronald L. Chrisley (1998). What Might Dynamical Intentionality Be, If Not Computation? Behavioral and Brain Sciences 21 (5):634-635.
Nir Fresco (2011). Concrete Digital Computation: What Does It Take for a Physical System to Compute? [REVIEW] Journal of Logic, Language and Information 20 (4):513-537.
Hava T. Siegelmann (2003). Neural and Super-Turing Computing. Minds and Machines 13 (1):103-114.
Stevan Harnad (1995). Grounding Symbols in Sensorimotor Categories with Neural Networks. Institute of Electrical Engineers Colloquium on "Grounding Representations.
Stevan Harnad (1994). Computation is Just Interpretable Symbol Manipulation; Cognition Isn't. Minds and Machines 4 (4):379-90.
James P. Crutchfield (1998). Dynamical Embodiments of Computation in Cognitive Processes. Behavioral and Brain Sciences 21 (5):635-635.
Added to index2009-01-28
Total downloads26 ( #96,358 of 1,696,615 )
Recent downloads (6 months)5 ( #115,452 of 1,696,615 )
How can I increase my downloads?