The multiple-computations theorem and the physics of singling out a computation

The Monist 105 (1):175-193 (2022)
  Copy   BIBTEX

Abstract

The problem of multiple-computations discovered by Hilary Putnam presents a deep difficulty for functionalism (of all sorts, computational and causal). We describe in out- line 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.

Author Profiles

Meir Hemmo
University of Haifa
Orly Shenker
Hebrew University of Jerusalem

Analytics

Added to PP
2022-03-18

Downloads
272 (#59,304)

6 months
118 (#32,992)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?