Computing the uncomputable; or, The discrete charm of second-order simulacra

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

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,150

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

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
2009-01-28

Downloads
190 (#104,730)

6 months
21 (#127,002)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Matthew Parker
London School of Economics

Citations of this work

The philosophy of computer science.Raymond Turner - 2013 - Stanford Encyclopedia of Philosophy.

Add more citations