David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Ezio Di Nucci
Jonathan Jenkins Ichikawa
Jack Alan Reynolds
Learn more about PhilPapers
Journal of Philosophical Logic 28 (2):141-164 (1999)
Stereotypically, computation involves intrinsic changes to the medium of representation: writing new symbols, erasing old symbols, turning gears, flipping switches, sliding abacus beads. Perspectival computation leaves the original inscriptions untouched. The problem solver obtains the output by merely alters his orientation toward the input. There is no rewriting or copying of the input inscriptions; the output inscriptions are numerically identical to the input inscriptions. This suggests a loophole through some of the computational limits apparently imposed by physics. There can be symbol manipulation without inscription manipulation because symbols are complex objects that have manipulatable elements besides their inscriptions. Since a written symbol is an ordered pair of consisting of a shape and the reader's orientation to that inscription, the symbol can be changed by changing the orientation rather than inscription. Although there are the usual physical limits associated with reading the answer, the computation is itself instantaneous. This is true even when the sub-calculations are algorithmically complex, exponentially increasing or even infinite
|Keywords||algorithmic complexity computation Cambridge event duals mirror NP-completeness symbol manipulation Turing machine|
|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
Jerry A. Fodor (1987). Psychosemantics: The Problem of Meaning in the Philosophy of Mind. MIT Press.
Rae Langton & David Lewis (1998). Defining 'Intrinsic'. Philosophy and Phenomenological Research 58 (2):333-345.
Michael R. Garey & David S. Johnson (1983). Computers and Intractability. A Guide to the Theory of NP-Completeness. Journal of Symbolic Logic 48 (2):498-500.
P. T. Geach (2000). God and the Soul. St. Augustine's Press.
F. P. Ramsey (1927). Facts and Propositions. Proceedings of the Aristotelian Society 7 (1):153-170.
Citations of this work BETA
Massimo Warglien & Achille C. Varzi (2003). The Geometry of Negation. Journal of Applied Non-Classical Logics 13 (1):9-19.
Similar books and articles
Stevan Harnad (1990). The Symbol Grounding Problem. Philosophical Explorations 42:335-346.
Richard H. Schlagel (1999). Why Not Artificial Consciousness or Thought? Minds and Machines 9 (1):3-28.
Karl F. MacDorman (1998). Feature Learning, Multiresolution Analysis, and Symbol Grounding. Behavioral and Brain Sciences 21 (1):32-33.
Stevan Harnad (1995). Grounding Symbols in Sensorimotor Categories with Neural Networks. Institute of Electrical Engineers Colloquium on "Grounding Representations.
Herbert L. Roitblat (2001). Computational Grounding. Psycoloquy 12 (58).
Susan Schneider (2009). The Nature of Symbols in the Language of Thought. Mind and Language 24 (5):523-553.
Michael L. Anderson & Donald R. Perlis (2002). Symbol Systems. In L. Nagel (ed.), Encyclopedia of Cognitive Science. Macmillan
Stevan Harnad, Symbol Grounding is an Empirical Problem: Neural Nets Are Just a Candidate Component.
Stevan Harnad (1994). Computation is Just Interpretable Symbol Manipulation; Cognition Isn't. Minds and Machines 4 (4):379-90.
Added to index2009-01-28
Total downloads44 ( #108,911 of 1,902,539 )
Recent downloads (6 months)11 ( #87,267 of 1,902,539 )
How can I increase my downloads?