PhilSci Archive

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

Parker, Matthew W. (2006) Computing the Uncomputable, or, The Discrete Charm of Second-Order Simulacra. In: [2006] Models and Simulations (Paris, 2006). (Unpublished)

WarningThere is a more recent version of this item available.
[img] Microsoft Word (.doc)
Download (5Mb)

    Abstract

    We study an especially attenuated application of “mediating models”, in which computer simulations suggest that a certain dynamical system exhibits non-computable behaviour. These simulations are defended by reference to a simpler model of the model (hence “second-order simulacra”). We will see that this defence is problematic, but there are general reasons to believe the simulations are accurate. And though these models do not prove anything specific about an actual physical system, they influence our general expectations, and provide an essential component for any complete explanation of why and how the qualitative behaviour of some actual systems may be non-computable.


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

    Item Type: Conference or Workshop Item (UNSPECIFIED)
    Keywords: computability, decidability, chaos, computable analysis, models, simulations
    Subjects: Specific Sciences > Physics > Classical Physics
    General Issues > Models and Idealization
    Specific Sciences > Computation/Information > Classical
    Specific Sciences > Computer Science
    Specific Sciences > Complex Systems
    Conferences and Volumes: [2006] Models and Simulations (Paris, 2006)
    Depositing User: Matthew Parker
    Date Deposited: 03 Jun 2006
    Last Modified: 07 Oct 2010 11:14
    Item ID: 2756
    Public Domain: No
    Conference Date: 12-13 June 206
    Conference Location: Paris
    URI: http://philsci-archive.pitt.edu/id/eprint/2756

    Available Versions of this Item

    Actions (login required)

    View Item

    Document Downloads