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

Synthese 169 (3):447 - 463 (2009)
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 No keywords specified (fix it)
Categories
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 5,631
External links
  •   Try with proxy.
  •   Try with proxy.
  •   Try with proxy.
  • Through your library Configure

    Similar books and articles

    Analytics

    Monthly downloads

    Added to index

    2009-01-28

    Total downloads

    15 ( #78,526 of 548,973 )

    Recent downloads (6 months)

    5 ( #15,091 of 548,973 )

    How can I increase my downloads?


    My notes
    Sign in to use this feature


    Discussion
    Start a new thread
    Order:
    There  are no threads in this forum
    Nothing in this forum yet.

    Other forums