A theory of computational implementation.
I articulate and defend a new theory of what it is for a physical system to implement an abstract computational model. According to my descriptivist theory, a physical system implements a computational model just in case the model accurately describes the system. Specifically, the system must reliab...
| Publicado en: | Synthese Vol. 191; no. 6; pp. 1277 - 1308 |
|---|---|
| Autor principal: | |
| Formato: | Artículo |
| Publicado: |
Springer Nature
Apr2014
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=94762618&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 94762618 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00397857 4LI jtl: Synthese issn: 00397857 maglogo: N pubinfo: dt: Apr2014 vid: 191 iid: 6 pid: 237 pub: Springer Nature artinfo: ui: 94762618 10.1007/s11229-013-0324-y ppf: 1277 ppct: 31 formats: fmt: @attributes: type: P size: 318KB tig: atl: A theory of computational implementation. aug: au: Rescorla, Michael affil: Department of Philosophy, University of California, Santa Barbara, Santa Barbara 93106 USA su: Computational learning theory Accuracy Representation (Philosophy) Philosophy Causal logic sug: subj: Computational learning theory Accuracy Representation (Philosophy) Philosophy Causal logic keyword: Computational implementation Physical computation Physical realization Representation Triviality arguments ab: I articulate and defend a new theory of what it is for a physical system to implement an abstract computational model. According to my descriptivist theory, a physical system implements a computational model just in case the model accurately describes the system. Specifically, the system must reliably transit between computational states in accord with mechanical instructions encoded by the model. I contrast my theory with an influential approach to computational implementation espoused by Chalmers, Putnam, and others. I deploy my theory to illuminate the relation between computation and representation. I also rebut arguments, propounded by Putnam and Searle, that computational implementation is trivial. pubtype: Academic Journal doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y custom: Synthese is a copyright of Springer, 2014. All Rights Reserved. item: Synthese holder: Springer Nature dt: @attributes: year: 2014 holdings: @attributes: islocal: N |
|---|