Linked bibliography for the SEP article "Computation in Physical Systems" by Gualtiero Piccinini and Corey Maley
This is an automatically generated and experimental page
If everything goes well, this page should display the bibliography of the aforementioned article as it appears in the Stanford Encyclopedia of Philosophy, but with links added to PhilPapers records and Google Scholar for your convenience. Some bibliographies are not going to be represented correctly or fully up to date. In general, bibliographies of recent works are going to be much better linked than bibliographies of primary literature and older works. Entries with PhilPapers records have links on their titles. A green link indicates that the item is available online at least partially.
This experiment has been authorized by the editors of the Stanford Encyclopedia of Philosophy. The original article and bibliography can be found here.
- Andréka, H., Németi, I., and P. Németi, 2009,
“General Relativistic Hypercomputing and Foundation of
Mathematics,” Natural Computing, 8(3):
499–516. (Scholar)
- Andréka, H., Madarász, J. X., Németi, I.,
Németi, P. and Székely, G., 2018, “Relativistic
computation,” in Cuffaro and Fletcher (eds.) 2018. (Scholar)
- Beggs, E. J., and J.V. Tucker, 2007, “Can Newtonian Systems,
Bounded in Space, Time, Mass and Energy Compute all Functions?”
Theoretical Computer Science, 371(1–2):
4–19. (Scholar)
- Block, N., 1978, “Troubles with Functionalism,” in Perception and Cognition: Issues in the Foundations of Psychology, C. W. Savage (ed.), Minneapolis, University of Minnesota Press, pp. 261–325. (Scholar)
- Blum, L., Cucker F., Shub M., and S. Smale, 1998, Complexity
and Real Computation, New York: Springer. (Scholar)
- Bontly, T., 1998, “Individualism and the Nature of Syntactic States,” British Journal for the Philosophy of Science, 49(4): 557–574. (Scholar)
- Bub, J., 2005, “Quantum Mechanics is About Quantum Information,” Foundations of Physics, 35(4): 541–560. (Scholar)
- Burge, T., 1986, “Individualism and Psychology,” Philosophical Review, 45: 3–45. (Scholar)
- Button, T., 2009, “SAD Computers and Two Versions of the Church-Turing Thesis,” British Journal for the Philosophy of Science, 60(4): 765–792. (Scholar)
- Calude, C. S., 2005, “Algorithmic Randomness, Quantum
Physics, and Incompleteness,” in Proceedings of the
Conference “Machines, Computations and Universality” (MCU
2004), M. Margenstern (ed.), Berlin: Springer, pp.
1–17. (Scholar)
- Calude, C. S., and B. Pavlov, 2002, “Coins, Quantum
Measurements, and Turing’s Barrier,” Quantum Information
Processing, 1(1–2): 107–127. (Scholar)
- Calude, C. S., and K. Svozil, 2008, “Quantum Randomness and
Value Indefiniteness,” Advanced Science Letters, 1(2):
165–168. (Scholar)
- Campbell, D. I., and Yang, Y., 2021, “Does the solar system
compute the laws of motion?” Synthese, 198:
3203–3220. (Scholar)
- Chalmers, D. J., 1995, “On Implementing a
Computation,” Minds and Machines, 4:
391–402. (Scholar)
- –––, 1996, “Does a Rock Implement Every Finite-State Automaton?” Synthese, 108: 310-333. (Scholar)
- –––, 2011, “A Computational Foundation for the Study of Cognition,” Journal of Cognitive Science, 12(4): 323–57. (Scholar)
- Chrisley, R. L., 1995, “Why Everything Doesn’t Realize Every
Computation,” Minds and Machines, 4:
403–430. (Scholar)
- Church, A., 1932, “A Set of Postulates for the Foundation of
Logic,” Annals of Mathematics, 33: 346–366. (Scholar)
- –––, 1936, “An Unsolvable Problem in Elementary Number Theory,” The American Journal of Mathematics, 58: 345–363. (Scholar)
- Churchland, P. S., and T. J. Sejnowski, 1992, The
Computational Brain, Cambridge, MA: MIT Press. (Scholar)
- Coelho Mollo, D., 2018, “Functional Individuation,
Mechanistic Implementation: The Proper Way of Seeing the Mechanistic
View of Concrete Computation,” Synthese, 195(8):
3477–97. (Scholar)
- Copeland, B. J., 1996, “What is Computation?” Synthese, 108(3): 335–359. (Scholar)
- –––, 2000, “Narrow Versus Wide Mechanism:
Including a Re-Examination of Turing’s Views on the Mind-Machine
Issue.” The Journal of Philosophy, XCVI(1):
5–33. (Scholar)
- –––, 2002, “Accelerating Turing Machines,” Minds and Machines, 12(2): 281–301. (Scholar)
- Crane, T., 1990, “The Language of Thought: No Syntax Without Semantics,” Mind and Language, 5(3): 187–212. (Scholar)
- Craver, C. F., 2012, “Functions and Mechanisms: A
Perspectivalist Account,” in P. Huneman (ed.),
Functions, Dordrecht: Springer. (Scholar)
- Cuffaro, Michael E., and Samuel C. Fletcher (eds.), 2018, Physical Perspectives on Computation, Computational Perspectives on Physics, Cambridge: Cambridge University Press. (Scholar)
- Cummins, R., 1983, The Nature of Psychological Explanation, Cambridge, MA: MIT Press. (Scholar)
- Curtis-Trudel, A., forthcoming-a, “Why Do We Need A Theory of Implementation?” British Journal for the Philosophy of Science. doi:10.1086/714791 (Scholar)
- Curtis-Trudel, A., forthcoming-b, “Implementation as
Resemblance,” Philosophy of Science.
doi:10.1086/714872 (Scholar)
- Davies, E. B., 2001, “Building Infinite Machines,” British Journal for the Philosophy of Science, 52(4): 671–682. (Scholar)
- Davis, M., 2004a, “The Myth of Hypercomputation,” in Alan Turing: Life and Legacy of a Great Thinker, C. Teuscher (ed.), Berlin: Springer, pp. 195–211. (Scholar)
- ––– (ed.), 2004b, The Undecidable: Basic
Papers on Undecidable Propositions, Unsolvable Problems and Computable
Functions, Dover: Mineola. (Scholar)
- Dennett, D. C., 1987, The Intentional Stance, Cambridge,
MA: MIT Press. (Scholar)
- Deutsch, D., 1985, “Quantum Theory, the Church-Turing
Principle and the Universal Quantum Computer,” Proceedings
of the Royal Society of London A, 400: 97–117. (Scholar)
- Dewhurst, J., 2018, “Computing Mechanisms without Proper Functions,” Minds and Machines, 28: 569–88. (Scholar)
- Dretske, F. I., 1981, Knowledge and the Flow of Information, Cambridge, MA: MIT Press. (Scholar)
- Duwell, A., 2017, “Exploring the Frontiers of Computation:
Measurement Based Quantum Computers and the Mechanistic View of
Computation,” in A. Bokulich and J. Floyd (eds.), Turing 100:
Philosophical Explorations of the Legacy of Alan Turing (Boston
Studies in the Philosophy and History of Science: Volume 324),
New York: Springer, 219–32. (Scholar)
- Earman, J., 1986, A Primer on Determinism, Dordrecht: D. Reidel. (Scholar)
- Earman, J., and J. Norton, 1993, “Forever is a Day: Supertasks in Pitowsky and Malament-Hogarth Spacetimes,” Philosophy of Science, 60: 22–42. (Scholar)
- Egan, F., 1999, “In Defence of Narrow Mindedness.” Mind and Language, 14(2): 177–194. (Scholar)
- –––, 2010, “Computational Models: A Modest Role For Content,” Studies in the History and Philosophy of Science, 41(3): 253–259. (Scholar)
- Etesi, G., and I. Németi, 2002, “Non-Turing Computations via Malament-Hogarth Spacetimes,” International Journal of Theoretical Physics, 41: 342–370. (Scholar)
- Feynman, R. P., 1982, “Simulating Physics with Computers,” International Journal of Theoretical Physics, 21(6–7): 467–488. (Scholar)
- Fodor, J. A., 1975, The Language of Thought, Cambridge, MA: Harvard University Press. (Scholar)
- –––, 1981, “The Mind-Body Problem,” Scientific American, 244: 114–125. (Scholar)
- –––, 2008, LOT 2: The Language of Thought Revisited, Oxford: Oxford University Press. (Scholar)
- Fredkin, E., 1990, “Digital Mechanics: An Information Process Based on Reversible Universal Cellular Automata,” Physica D, 45: 254–270. (Scholar)
- Fresco, N., 2010, “Explaining Computation Without Semantics: Keeping It Simple,” Minds and Machines, 20: 165–181. (Scholar)
- –––, 2014, Physical Computation and
Cognitive Science, New York: Springer. (Scholar)
- Fuchs, C. A., 2004, “Quantum Mechanics as Quantum
Information (and only a little more),” in Quantum Theory:
Reconsiderations of Foundations, A. Khrennikov (ed.),
Växjö, Sweden: Växjö University Press, pp.
463–543. (Scholar)
- Gandy, R., 1980, “Church’s Thesis and Principles for
Mechanism,” in J. Barwise, H. J. Keisler, K. Kunen
(eds.), The Kleene Symposium: Studies in Logic and the Foundations
of Mathematics, Amsterdam: North-Holland Publishing. (Scholar)
- Garson, J., 2013, “The Functional Sense of Mechanism,” Philosophy of Science, 80: 317–333. (Scholar)
- Gödel, K., 1934, “On Undecidable Propositions of Formal
Mathematical Systemsm,” in The Undecidable, M. Davis
(ed.), Ewlett, NY: Raven, pp. 41–71. (Scholar)
- –––, 1936. “Über die Lange von
Beweisen,” Ergebnisse eines mathematischen Kolloquiums,
7: 23–24. (Scholar)
- –––, 1946, “Remarks Before the Princeton
Bicentennial Conference on Problems in Mathematics,” reprinted
in Davis 2004b, pp. 84–88. (Scholar)
- Godfrey-Smith, P., 2009, “Triviality Arguments Against Functionalism,” Philosophical Studies, 145(2): 273–295. (Scholar)
- Grice, H. P., 1957, “Meaning,” The Philosophical Review, 66(3): 377–388. (Scholar)
- Hagar, A., and A. Korolev, 2007, “Quantum Hypercomputation--Hyper or Computation?,” Philosophy of Science, 74(3): 347–363. (Scholar)
- Hamkins, J. D., 2002. “Infinite Time Turing Machines,” Minds and Machines, 12: 521–539. (Scholar)
- Harman, G., 1987, “(Nonsolipsistic) Conceptual Role Semantics,” in New Directions in Semantics, E. Lepore (ed.), London: Academic Press, pp. 55–81. (Scholar)
- Hogarth, M. L., 1994, “Non-Turing Computers and Non-Turing Computability,” PSA 1994(1): 126–138. (Scholar)
- –––, 2004, “Deciding Arithmetic Using SAD Computers,” British Journal for the Philosophy of Science, 55: 681–691. (Scholar)
- Isaac, A., 2019, “The Semantics Latent in Shannon
Information,” British Journal for the Philosophy of
Science, 70(1): 103–125. (Scholar)
- Jacquette, D., 1991, “The Myth of Pure Syntax,” in
Topics in Philosophy and Artificial Intelligence, L.
Albertazzi and R. Rolli (eds.), Bozen: Istituto Mitteleuropeo di
Cultura, pp. 1–14. (Scholar)
- Kantor, F. W., 1982, “An Informal Partial Overview of
Information Mechanics,” International Journal of Theoretical
Physics, 21(6–7): 525–35. (Scholar)
- Kaplan, D. M., 2011, “Explanation and Description in Computational Neuroscience,” Synthese, 183(3): 339–373. (Scholar)
- Kieu, T. D., 2002, “Quantum Hypercomputation,” Minds and Machines, 12(4): 541–561. (Scholar)
- –––, 2003, “Computing the
Noncomputable,” Contemporary Physics, 44:
51–71. (Scholar)
- –––, 2004, “A Reformulation of Hilbert’s
Tenth Problem through Quantum Mechanics,” Proceedings of the
Royal Society A, 460(2045): 1535–1545. (Scholar)
- –––, 2005, “An Anatomy of a Quantum
Adiabatic Algorithm that Transcends the Turing Computability,”
International Journal of Quantum Information, 3(1):
177–183. (Scholar)
- Kleene, S. C., 1935, “A Theory of Positive Integers in
Formal Logic,” American Journal of Mathematics, 57:
153–173 and 219–244. (Scholar)
- –––, 1952, Introduction to Metamathematics, Princeton: Van Nostrand. (Scholar)
- Klein, C., 2008, “Dispositional Implementation Solves the Superfluous Structure Problem,” Synthese, 165: 141–153. (Scholar)
- Leff, H. S. and A.F. Rex, (eds.), 2003, Maxwell’s Demon 2:
Entropy, Classical and Quantum Information, Computing, Bristol:
Institute of Physics Publishing. (Scholar)
- Lloyd, S., 2006, Programming the Universe: A Quantum Computer Scientist Takes on the Cosmos, New York: Knopf. (Scholar)
- Lycan, W., 1981, “Form, Function, and Feel,” Journal of Philosophy, 78(1): 24–50. (Scholar)
- Machamer, P. K., Darden, L., and C. Craver, 2000, “Thinking About Mechanisms,” Philosophy of Science, 67: 1–25. (Scholar)
- Maley, C. J., forthcoming, “Analog Computation and Representation,” British Journal for the Philosophy of Science. doi:10.1086/715031 (Scholar)
- Martin, C. B., 1997, “On the Need for Properties: The Road to Pythagoreanism and Back,” Synthese, 112(2): 193–231. (Scholar)
- Maudlin, T., 1989, “Computation and Consciousness,” Journal of Philosophy, 86(8): 407–432. (Scholar)
- Milkowski, M., 2013, Explaining the Computational Mind, Cambridge, MA: MIT Press. (Scholar)
- Mills, J. W., 2008, “The Nature of the Extended Analog
Computer,” Physica D: Nonlinear Phenomena, 237(9):
1235–1256. (Scholar)
- Németi, I., and G. Dávid, 2006, “Relativistic Computers and the Turing Barrier,” Journal of Applied Mathematics and Computation, 178(1): 118–142. (Scholar)
- Nielsen, M. A., 1997, “Computable Functions, Quantum Measurements, and Quantum Dynamics,” Physical Review Letters, 79(15): 2915–2918. (Scholar)
- Nielsen, M. A., and I. L. Chuang, 2000, Quantum Computation and Quantum Information, New York: Cambridge University Press. (Scholar)
- Ord, T., 2006, “The Many Forms of Hypercomputation,” Applied Mathematics and Computation, 178(1): 143–153. (Scholar)
- Papayannopoulos, P., 2020, “Computing and modelling: Analog vs. Analogue,” Studies in History and Philosophy of Science, 83: 103–120. (Scholar)
- Piccinini, G., 2004, “Functionalism, Computationalism, and Mental Contents,” Canadian Journal of Philosophy, 34(3): 375–410. (Scholar)
- –––, 2007, “Computing Mechanisms,” Philosophy of Science, 74(4): 501–526. (Scholar)
- –––, 2010, “The Mind as Neural Software? Understanding Functionalism, Computationalism, and Computational Functionalism,” Philosophy and Phenomenological Research, 81(2): 269–311. (Scholar)
- –––, 2015, Physical Computation: A Mechanistic Account, Oxford: Oxford University Press. (Scholar)
- Piccinini, G. and A. Scarantino, 2011, “Information Processing, Computation, and Cognition,” Journal of Biological Physics 37(1): 1–38. (Scholar)
- Pitowsky, I., 1990, “The Physical Church Thesis and Physical Computational Complexity,” Iyyun, 39: 81–99. (Scholar)
- –––, 2002, “Quantum Speed-Up of Computations,” Philosophy of Science, 69: S168-S177. (Scholar)
- Pour-El, M. B., 1974, “Abstract Computability and Its
Relation to the General Purpose Analog Computer (Some Connections
Between Logic, Differential Equations and Analog Computers),”
Transactions of the American Mathematical Society, 199:
1–28. (Scholar)
- –––, 1999, The Structure of Computability in
Analysis and Physical Theory: An Extension of Church’s Thesis. In
Handbooks of Computability Theory, E.R. Griffor (ed.), New
York: Elsevier, pp. 449–471. (Scholar)
- Putnam, H., 1960, “Minds and Machines,” in Dimensions of Mind: A Symposium, S. Hook (ed.), New York: Collier, pp. 138–164; Reprinted in Putnam 1975a, pp. 362–386. (Scholar)
- –––, 1967, “Psychological Predicates,” in Art, Mind, and Religion, W.H. Capitan & D.D. Merrill (eds.), Pittsburgh, PA: University of Pittsburgh Press, pp. 37–48. Reprinted in Putnam 1975a as “The Nature of Mental States,” pp. 150–161. (Scholar)
- –––, 1975a, Philosophical Papers: Volume 2, Mind, Language and Reality, Cambridge: Cambridge University Press. (Scholar)
- –––, 1975b, “The Meaning of
‘Meaning’,” in Language, Mind and Knowledge.
Minnesota Studies in the Philosophy of Science, vol. 7, K.
Gunderson (ed.), Minneapolis: University of Minnesota Press, pp.
131–193. Reprinted in Putnam 1975a, pp. 215–271. (Scholar)
- –––, 1988, Representation and Reality, Cambridge, MA: MIT Press. (Scholar)
- Pylyshyn, Z. W., 1984, Computation and Cognition, Cambridge, MA: MIT Press. (Scholar)
- Quine, W. V. O., (1976), “Whither Physical Objects?” in Essays in Memory of Imre Lakatos, (Series: Boston Studies in the Philosophy of Science), R.S. Cohen, P.K. Feyerabend, & M.W. Wartofsky (eds.), Dordrecht: Reidel, pp. 497–504. (Scholar)
- Rescorla, M., 2014, “A Theory of Computational Implementation,” Synthese, 191: 1277–1307. (Scholar)
- Rubel, L. A., 1989, “Digital Simulation of Analog
Computation and Church’s Thesis,” Journal of Symbolic
Logic, 54(3): 1011–1017. (Scholar)
- –––, 1993, “The Extended Analog
Computer,” Advances in Applied Mathematics, 14(1):
39–50. (Scholar)
- Scheutz, M., 1999, “When Physical Systems Realize Functions …,” Minds and Machines, 9(2): 161–196. (Scholar)
- –––, 2001, “Causal versus Computational Complexity,” Minds and Machines, 11(4): 534–566. (Scholar)
- Schonbein, W., 2005, “Cognition and the Power of Continuous
Dynamical Systems,” Minds and Machines, 15(1):
57–71. (Scholar)
- Searle, J. R., 1992, The Rediscovery of the Mind, Cambridge, MA: MIT Press. (Scholar)
- Segal, G., 1991, “Defence of a Reasonable Individualism,” Mind, 100(400): 485–493. (Scholar)
- Shagrir, O., 2001. “Content, Computation and Externalism,” Mind, 110(438): 369–400. (Scholar)
- –––, 2006, “Why We View the Brain as a Computer,” Synthese, 153(3): 393–416. (Scholar)
- –––, forthcoming, The Nature of Physical Computation, Oxford: Oxford University Press. (Scholar)
- Shagrir, O., and I. Pitowsky, 2003, “Physical Hypercomputation and the Church-Turing Thesis,” Minds and Machines, 13(1): 87–101. (Scholar)
- Shannon, C. E., and W. Weaver, 1949, The Mathematical Theory of Communication, Urbana: University of Illinois Press. (Scholar)
- Shapiro, L. A., 1997, “A Clearer Vision,” Philosophy of Science, 64(1): 131–153. (Scholar)
- Shor, P. W., 1994, “Algorithms for Quantum Computation: Discrete Logarithms and Factoring,” in Proceedings of the 357th Annual Symposium on Foundations of Computer Science, Los Alamitos, CA: IEEE Computer Society Press, pp. 124–134. (Scholar)
- Sieg, W., 2006, “On Computability,” in Philosophy
of Mathematics (Handbook of the Philosophy of Science), A. Irvine
(ed.) Amsterdam: Elsevier, pp. 535–630. (Scholar)
- Siegelmann, H. T., 1999, Neural Networks and Analog
Computation: Beyond the Turing Limit, Boston:
Birkhäuser. (Scholar)
- Šíma, J., and P. Orponen, 2003,
“General-purpose Computation with Neural Networks: A Survey of
Complexity Theoretic Results,” Neural Computation, 15:
2727–78. (Scholar)
- Smith, B. C., 2002, “The Foundations of Computing,” in Computationalism: New Directions, M. Scheutz (ed.), Cambridge, MA: MIT Press, pp. 23–58. (Scholar)
- Smith, W. D., 2006a, “Church’s Thesis Meets the
N-body Problem,” Applied Mathematics and
Computation, 178(1): 154–183. (Scholar)
- –––, 2006b, “Three Counterexamples
Refuting Kieu’s Plan for Quantum Adiabatic Hypercomputation; and Some
Uncomputable Quantum Mechanical Tasks,” Applied Mathematics
and Computation, 178(1): 184–193. (Scholar)
- Stannett, M., 1990, “X-Machines and the Halting Problem:
Building a Super-Turing Machine,” Formal Aspects of
Computing, 2(1): 331–341. (Scholar)
- Stich, S., 1983, From Folk Psychology to Cognitive Science, Cambridge, MA: MIT Press. (Scholar)
- Toffoli, T., 1982, “Physics and Computation,”
International Journal of Theoretical Physics, 21(3–4):
165–175. (Scholar)
- Tucker, Chris, 2018, “How to Explain Miscomputation,” Philosophers’ Imprint, 18(24). [Tucker 2018 available online] (Scholar)
- Turing, A. M., 1936–7, “On Computable Numbers, with an Application to the Entscheidungsproblem,” Proceeding of the London Mathematical Society, 42(1): 230–265, reprinted in Davis 2004b, pp. 116–154. (Scholar)
- –––, 1950, “Computing Machinery and Intelligence,” Mind, LIX(236): 433–460. (Scholar)
- Wheeler, J. A., 1982, “The Computer and the Universe,”
International Journal of Theoretical Physics, 21(6–7):
557–572. (Scholar)
- –––, 1989, “Information, Physics, Quantum: The Search for Links,” Proceedings III International Symposium on Foundations of Quantum Mechanics, Tokyo, 354–358. (Scholar)
- Wolfram, S., 2002, A New Kind of Science, Champaign, IL: Wolfram Media. (Scholar)
- Zuse, K., 1970, Calculating Space, Cambridge, MA: MIT
Press. (Scholar)
- –––, 1982, “The Computing Universe,”
International Journal of Theoretical Physics, 21(6–7):
589–600. (Scholar)