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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alexander J.C., Yorke J.A., You Z., Kan I. (1992) Riddled basins. International Journal of Bifurcation and Chaos 2: 795–813
Berkovitz J., Frigg R., Kronz F. (2006) The ergodic hierarchy, decay of correlations, and Hamiltonian chaos. Studies in the History and Philosophy of Modern Physics 37: 661–991
Borges, J. L., & Casares, A. B. ([1946] 1999). On exactitude in science (A. Hurley, Trans.). In J. L. Borges (Ed.), Collected fictions. New York: Viking Penguin.
Carroll, L. ([1893] 2005). Sylvie and Bruno concluded. Retrieved May 31, 2006, from http://www.hoboes.com/html/FireBlade/Carroll/Sylvie/Concluded
Chaitin G. (1993) Randomness in arithmetic and the decline and fall of reductionism in pure mathematics. EATCS Bulletin 50: 314–328
Feferman S. (2006) Are there absolutely unsolvable problems?. Gödel’s dichotomy. Philosophia Mathematica 14: 134–152
Franzen T. (1987) Provability and truth: Stockholm studies in philosophy (Vol. 9). Almqvist and Wiksell International, Stockholm
Gelfert, A. (2006). Simulating many-body models in physics: Rigorous results, ‘benchmarks’, and cross-model justification. PhilSci Archive. http://philsci-archive.pitt.edu/archive/00002789
Gödel, K. ([1951] 1995). Some basic theorems on the foundations of mathematics and their implications. In Collected works, Vol. III: Unpublished essays and lectures. New York: Oxford University Press.
Grzegorczyk A. (1955) Computable functionals. Fundamenta Mathematicae 42: 169–202
Hartmann S. (1996) The world as a process: Simulations in the natural and social sciences. In: Hegselmann R. et al (eds) Modeling and simulation in the social sciences from the philosophy of science point of view. Kluwer, Dordrecht, pp 77–100
Heagy J.F., Carroll T.L., Pecora L.M. (1994) Experimental and numerical evidence for riddled basins in coupled chaotic systems. Physical Review Letters 73: 3528–3531
Hughes R.I.G. (1999) The Ising model, computer simulation, and universal physics. In: Morgan M.S., Morrison M. (eds) Models as mediators: Prespectives on natural and social science. Cambridge University Press, Cambridge, pp 97–145
Kan I. (1994) Open sets of diffeomorphisms having two attractors, each with an everywhere dense basin. Bulletin (New Series) of the American Mathematical Society 31: 68–74
Ko K.-I. (1991) Complexity theory of real functions. Birkhauser, Boston
Koellner P. (2006) On the question of absolute undecidability. Philosophia Mathematica 14: 153–188
Ku Y.H., Sun X. (1990) CHAOS and limit cycle in Duffing’s equation. Journal of the Franklin Institute 327: 165–195
Lorenz E.N. (1963) Deterministic non-periodic flow. Journal of the Atmospheric Sciences 20: 130–141
Milnor J. (1985) On the concept of attractor. Communications in Mathematical Physics 99: 177–195
Morgan, M.S., Morrison, M. (eds) (1999) Models as mediators: Perspectives on natural and social science. Cambridge University Press, Cambridge
Morton A. (1993) Mathematical models: Questions of trustworthiness. British Journal for the Philosophy of Science 44: 659–674
Myrvold W.C. (1997) The decision problem for entanglement. In: Cohen R.S. et al (eds) Potentiality, entanglement, and passion-at-a-distance. Kluwer Academic Publishers, Great Britain, pp 177–190
Ott E., Alexander J.C., Kan I., Sommerer J.C., Yorke J.A. (1994) The transition to chaotic attractors with riddled basins. Physica D 76: 384
Ott E., Sommerer J.C. (1994) Blowout bifurcations: The occurrence of riddled basins and on-off intermittency. Physics Letters A 188: 39–47
Ott E., Sommerer J.C., Alexander J.C., Kan I., Yorke J.A. (1993) Scaling behavior of chaotic systems with riddled basins. Physical Review Letters 71: 4134–4137
Parker M.W. (2003) Undecidability in Rn: Riddled basins, the KAM tori, and the stability of the solar system. Philosophy of Science 70: 359–382
Parker, M. W. (2005). Undecidable long-term behavior in classical physics: Foundations, results, and interpretation. Ph.D. Dissertation, University of Chicago.
Parker M.W. (2006) Three concepts of decidability for general subsets of uncountable spaces. Theoretical Computer Science 351: 2–13
Sommerer J.C., Ott E. (1996) Intermingled basins of attraction: Uncomputability in a simple physical system. Physics Letters A 214: 243–251
Weihrauch K. (2000) Computable analysis: An introduction. Springer, Berlin
Winsberg E. (2001) Simulations, models, and theories: Complex physical systems and their representations. Philosophy of Science 68(Proceedings): S443–S454
Winsberg E. (2003) Simulated experiments: Methodology for a virtual world. Philosophy of Science 70: 105–125
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Parker, M.W. Computing the uncomputable; or, The discrete charm of second-order simulacra. Synthese 169, 447–463 (2009). https://doi.org/10.1007/s11229-008-9441-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11229-008-9441-4