Abstract
This article 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 nonmathematical features. I argue that this approach comports well with computer scientific practice and offers a novel response to so-called triviality arguments.
Publisher
Cambridge University Press (CUP)
Subject
History and Philosophy of Science,Philosophy,History
Reference17 articles.
1. Physical Computation
2. On Computable Numbers, with an Application to the Entscheidungsproblem;Turing;Proceedings of the London Mathematical Society,1936
3. ON COMPUTABILITY
4. Do Accelerating Turing Machines Compute the Uncomputable?;Copeland;Minds and Machines,2011
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Selected Results from Physical Information Theory;The Physical Signature of Computation;2024-06-01
2. Satisfaction of Criterion PCE;The Physical Signature of Computation;2024-06-01
3. Glossary;The Physical Signature of Computation;2024-06-01
4. Conclusion;The Physical Signature of Computation;2024-06-01
5. Computation and the Mind;The Physical Signature of Computation;2024-06-01