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

DOI10.1007/S11229-008-9441-4zbMath1178.93006OpenAlexW1978840400MaRDI QIDQ1036071

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

zbMATH Keywords

heuristicschaosdynamical systemsnonlinear dynamicsmodelsdecidabilitycomputer simulationcomputabilityproofvalidationundecidable

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The ergodic hierarchy, randomness and Hamiltonian chaos
• Three concepts of decidability for general subsets of uncountable spaces
• CHAOS and limit cycle in Duffing's equation
• On the concept of attractor
• The transition to chaotic attractors with riddled basins
• 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
• Computable functionals
• Are There Absolutely Unsolvable Problems? Godel's Dichotomy
• On the Question of Absolute Undecidability
• Open sets of diffeomorphisms having two attractors, each with an everywhere dense basin
• RIDDLED BASINS
• Scaling behavior of chaotic systems with riddled basins
• Deterministic Nonperiodic Flow

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