PhilSci Archive

Computing the Uncomputable, or, The Discrete Charm of Second-order Simulacra

Parker, Matthew W. (2008) Computing the Uncomputable, or, The Discrete Charm of Second-order Simulacra. In: UNSPECIFIED.

This is the latest version of this item.


Download (188kB)


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.

Export/Citation: EndNote | BibTeX | Dublin Core | ASCII/Text Citation (Chicago) | HTML Citation | OpenURL
Social Networking:
Share |

Item Type: Conference or Workshop Item (UNSPECIFIED)
Parker, Matthew W.
Keywords: Chaos basin attraction attractor computability decidability computer simulation scaling riddled non-computability undecidability Chaitin validation
Subjects: General Issues > Models and Idealization
Specific Sciences > Computation/Information > Classical
Specific Sciences > Complex Systems
Specific Sciences > Physics
Depositing User: Matthew Parker
Date Deposited: 02 Nov 2008
Last Modified: 07 Oct 2010 15:16
Item ID: 3905

Available Versions of this Item

Monthly Views for the past 3 years

Monthly Downloads for the past 3 years

Plum Analytics

Actions (login required)

View Item View Item