Synthese 169 (3):447-463 (2009)

Authors
Matthew Parker
London School of Economics
Abstract
We examine a case in which non-computable behavior in a model is revealed by computer simulation. This is possible due to differing notions of computability for sets in a continuous space. The argument originally given for the validity of the simulation involves a simpler simulation of the simulation, still further simulations thereof, and a universality conjecture. There are difficulties with that argument, but there are other, heuristic arguments supporting the qualitative results. It is urged, using this example, that absolute validation, while highly desirable, is overvalued. Simulations also provide valuable insights that we cannot yet (if ever) prove.
Keywords Philosophy   Metaphysics   Philosophy of Language   Logic   Epistemology   Computer Science, general   Philosophy of Science
Categories (categorize this paper)
Reprint years 2008, 2009
DOI 10.1007/s11229-008-9441-4
Options
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: 58,937
Through your library

References found in this work BETA

Simulated Experiments: Methodology for a Virtual World.Winsberg Eric - 2003 - Philosophy of Science 70 (1):105-125.
Mathematical Models: Questions of Trustworthiness.Adam Morton - 1993 - British Journal for the Philosophy of Science 44 (4):659-674.
The Ergodic Hierarchy, Randomness and Hamiltonian Chaos.Joseph Berkovitz, Roman Frigg & Fred Kronz - 2006 - Studies in History and Philosophy of Modern Physics 37 (4):661-691.
Simulations, Models, and Theories: Complex Physical Systems and Their Representations.Eric Winsberg - 2001 - Proceedings of the Philosophy of Science Association 2001 (3):S442-.

View all 16 references / Add more references

Citations of this work BETA

The Philosophy of Computer Science.Raymond Turner - 2013 - Stanford Encyclopedia of Philosophy.

Add more citations

Similar books and articles

Computing the Uncomputable.John L. Casti - 1997 - Complexity 2 (3):7-12.
Consciousness: Computing the Uncomputable.T. Triffet & H. S. Green - 1996 - Mathematical and Computational Modelling 24:37-56.
Simulation, Simulacra and Solaris.Julian Haladyn & Miriam Jordan - 2010 - Film-Philosophy 14 (1):253-273.
The Discrete Charm of European Intellectuals.Hamid Dabashi - 2009 - International Journal of Žižek Studies 3 (4).
WHAT IS. . . A Halting Probability?Cristian S. Calude - 2010 - Notices of the AMS 57:236-237.
Simulacra in the Age of the New World Order.Alexander Gungov - 2006 - The Proceedings of the Twenty-First World Congress of Philosophy 2:263-268.
What a Course on Philosophy of Computing is Not.Vincent C. Müller - 2008 - APA Newsletter on Philosophy and Computers 8 (1):36-38.
Decidable Discrete Linear Orders.M. Moses - 1988 - Journal of Symbolic Logic 53 (2):531-539.

Analytics

Added to PP index
2009-01-28

Total views
140 ( #71,516 of 2,426,580 )

Recent downloads (6 months)
13 ( #53,857 of 2,426,580 )

How can I increase my downloads?

Downloads

My notes