Philosophy of Science (forthcoming)

Andre Curtis-Trudel
Ohio State University
This paper advertises a new account of computational implementation. According to the resemblance account, implementation is a matter of resembling a computational architecture. The resemblance account departs from previous theories by denying that computational architectures are exhausted by their formal, mathematical features. Instead, they are taken to be permeated with causality, spatiotemporality, and other non-mathematical features. I argue that this approach comports well with computer scientific practice, and offers a novel response to so-called triviality arguments.
Keywords Implementation  Resemblance  Physical Computation
Categories (categorize this paper)
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 64,132
External links

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

On Computable Numbers, with an Application to the N Tscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
Models and Fictions in Science.Peter Godfrey-Smith - 2009 - Philosophical Studies 143 (1):101 - 116.
Computation Without Representation.Gualtiero Piccinini - 2008 - Philosophical Studies 137 (2):205-241.

View all 19 references / Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Why Do We Need a Theory of Implementation?Andre Curtis-Trudel - forthcoming - British Journal for the Philosophy of Science.
Resemblance.Sam Cowling - 2017 - Philosophy Compass 12 (4):e12401.
Against Structuralist Theories of Computational Implementation.Michael Rescorla - 2013 - British Journal for the Philosophy of Science 64 (4):681-707.
Computation, Implementation, Cognition.Oron Shagrir - 2012 - Minds and Machines 22 (2):137-148.
Computational Vs. Causal Complexity.Matthias Scheutz - 2001 - Minds and Machines 11 (4):543-566.
When Physical Systems Realize Functions.Matthias Scheutz - 1999 - Minds and Machines 9 (2):161-196.
Triviality Arguments Reconsidered.Paul Schweizer - 2019 - Minds and Machines 29 (2):287-308.
The Swapping Constraint.Henry Schiller - 2018 - Minds and Machines 28 (3):605-622.
On Implementing a Computation.David J. Chalmers - 1994 - Minds and Machines 4 (4):391-402.
Is Computation Based on Interpretation?Marcin Miłkowski - 2012 - Semiotica 2012 (188):219-228.
Computational Versus Causal Complexity.Matthias Scheutz - 2001 - Minds and Machines 11 (4):543-566.
Resemblance As Repleteness: A Solution To Goodman’s Problem.Daniel Barnes - 2006 - Postgraduate Journal of Aesthetics 3 (2):59-65.


Added to PP index

Total views
23 ( #476,357 of 2,454,726 )

Recent downloads (6 months)
8 ( #84,331 of 2,454,726 )

How can I increase my downloads?


My notes