Can computers carry content "inexplicitly"?

Minds and Machines 4 (3):333-44 (1994)
  Copy   BIBTEX

Abstract

I examine whether it is possible for content relevant to a computer''s behavior to be carried without an explicit internal representation. I consider three approaches. First, an example of a chess playing computer carrying emergent content is offered from Dennett. Next I examine Cummins response to this example. Cummins says Dennett''s computer executes a rule which is inexplicitly represented. Cummins describes a process wherein a computer interprets explicit rules in its program, implements them to form a chess-playing device, then this device executes the rules in a way that exhibits them inexplicitly. Though this approach is intriguing, I argue that the chess-playing device cannot exist as imagined. The processes of interpretation and implementation produce explicit representations of the content claimed to be inexplicit. Finally, the Chinese Room argument is examined and shown not to save the notion of inexplicit information. This means the strategy of attributing inexplicit content to a computer which is executing a rule, fails

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,783

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
82 (#204,265)

6 months
6 (#514,728)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Paul Skokowski
Stanford University

Citations of this work

Information, belief, and causal role.Paul G. Skokowski - 1999 - In Lawrence Moss, Gizburg S., Rijke Jonathaden & Maarten (eds.), Logic, Language and Computation Vol. CSLI Publications.

Add more citations