Multiple-Computations Theorem and the Physics of Singling Out a Computation.
The problem of multiple-computations discovered by Hilary Putnam presents a deep difficulty for functionalism (of all sorts, computational and causal). We describe in outline why Putnam's result, and likewise the more restricted result we call the Multiple-Computations Theorem, are in fact theorems...
| Publicado en: | Monist Vol. 105; no. 2; pp. 175 - 194 |
|---|---|
| Autores principales: | , |
| Formato: | Artículo |
| Publicado: |
Oxford University Press / USA
Apr2022
|
| 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=155868157&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 155868157 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00269662 MST jtl: Monist issn: 00269662 maglogo: N pubinfo: dt: Apr2022 vid: 105 iid: 2 pid: 622 pub: Oxford University Press / USA artinfo: ui: 155868157 10.1093/monist/onab030 ppf: 175 ppct: 19 formats: fmt: – @attributes: type: T – @attributes: type: P size: 360KB tig: atl: Multiple-Computations Theorem and the Physics of Singling Out a Computation. aug: au: Hemmo, Meir Shenker, Orly affil: Philosophy Department, University of Haifa , Haifa 3498838, Israel Philosophy Department, The Hebrew University of Jerusalem , Jerusalem 91905, Israel su: Putnam, Hilary, 1926-2016 Quantum theory Quantum measurement Statistical mechanics Computer systems Quantum mechanics sug: subj: Putnam, Hilary, 1926-2016 Quantum theory Quantum measurement Statistical mechanics Computer systems Quantum mechanics ab: The problem of multiple-computations discovered by Hilary Putnam presents a deep difficulty for functionalism (of all sorts, computational and causal). We describe in outline why Putnam's result, and likewise the more restricted result we call the Multiple-Computations Theorem, are in fact theorems of statistical mechanics. We show why the mere interaction of a computing system with its environment cannot single out a computation as the preferred one amongst the many computations implemented by the system. We explain why nonreductive approaches to solving the multiple-computations problem, and in particular why computational externalism, are dualistic in the sense that they imply that nonphysical facts in the environment of a computing system single out the computation. We discuss certain attempts to dissolve Putnam's unrestricted result by appealing to systems with certain kinds of input and output states as a special case of computational externalism, and show why this approach is not workable without collapsing to behaviorism. We conclude with some remarks about the nonphysical nature of mainstream approaches to both statistical mechanics and the quantum theory of measurement with respect to the singling out of partitions and observables. pubtype: Academic Journal doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y custom: © 2019 Hegeler Institute. item: Monist holder: Oxford University Press / USA dt: @attributes: year: 2022 holdings: @attributes: islocal: N |
|---|