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

DOI10.1007/S11229-008-9441-4zbMATH Open1178.93006OpenAlexW1978840400MaRDI QIDQ1036071FDOQ1036071

Authors: Matthew W. Parker 

Publication date: 4 November 2009

Published in: Synthese (Search for Journal in Brave)

Full work available at URL: http://philsci-archive.pitt.edu/3905/1/Discrete_Charm_i.pdf

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Computability and dynamical systems
• Machines, Computations, and Universality
• Feasibility of numerical modelling: Information aspect
• scientific article; zbMATH DE number 1909825
• The computable universe hypothesis

zbMATH Keywords

heuristicsdynamical systemschaosvalidationdecidabilitymodelsnonlinear dynamicscomputer simulationcomputabilityproofundecidable

Mathematics Subject Classification ID

General systems (93A10) Stability of control systems (93D99)

Cites Work

• Deterministic Nonperiodic Flow
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the concept of attractor
• RIDDLED BASINS
• Open sets of diffeomorphisms having two attractors, each with an everywhere dense basin
• CHAOS and limit cycle in Duffing's equation
• Computable functionals
• The ergodic hierarchy, randomness and Hamiltonian chaos
• The transition to chaotic attractors with riddled basins
• Scaling behavior of chaotic systems with riddled basins
• Title not available (Why is that?)
• Intermingled basins of attraction: uncomputability in a simple physical system
• Undecidability in Rⁿ: Riddled Basins, the KAM Tori, and the Stability of the Solar System
• Three concepts of decidability for general subsets of uncountable spaces
• Are There Absolutely Unsolvable Problems? Godel's Dichotomy
• On the Question of Absolute Undecidability
• Title not available (Why is that?)

Cited In (2)

• Computer simulations and experiments: the case of the Higgs boson
• Feasibility of numerical modelling: Information aspect

This page was built for publication: Computing the uncomputable; or, the discrete charm of second-order simulacra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1036071)