Computing the uncomputable; or, the discrete charm of second-order simulacra
type: Item
instance of: scholarly article
title: Computing the uncomputable; or, the discrete charm of second-order simulacra
zbMATH Open document ID: 1178.93006
author: Matthew W. Parker
published in: Synthese
publication date: 2009-11-04T00:00:00Z
full work available at URL: Discrete Charm i.pdf
Mathematics Subject Classification ID: 93A10
Mathematics Subject Classification ID: 93A30
Mathematics Subject Classification ID: 68U20
Mathematics Subject Classification ID: 93D99
zbMATH DE Number: 5625288
zbMATH Keywords: computability
zbMATH Keywords: decidability
zbMATH Keywords: undecidable
zbMATH Keywords: computer simulation
zbMATH Keywords: validation
zbMATH Keywords: models
zbMATH Keywords: chaos
zbMATH Keywords: dynamical systems
zbMATH Keywords: nonlinear dynamics
zbMATH Keywords: proof
zbMATH Keywords: heuristics
MaRDI profile type: Publication
OpenAlex ID: W1978840400
cites work: RIDDLED BASINS
cites work: The ergodic hierarchy, randomness and Hamiltonian chaos
cites work: Q4431358
cites work: Are There Absolutely Unsolvable Problems? Godel's Dichotomy
cites work: Computable functionals
cites work: Open sets of diffeomorphisms having two attractors, each with an everywhere dense basin
cites work: Q4002474
cites work: On the Question of Absolute Undecidability
cites work: CHAOS and limit cycle in Duffing's equation
cites work: Deterministic Nonperiodic Flow
cites work: On the concept of attractor
cites work: Q4530487
cites work: The transition to chaotic attractors with riddled basins
cites work: Scaling behavior of chaotic systems with riddled basins
cites work: Undecidability in Rn: Riddled Basins, the KAM Tori, and the Stability of the Solar System
cites work: Three concepts of decidability for general subsets of uncountable spaces
cites work: Intermingled basins of attraction: uncomputability in a simple physical system
cites work: Q4485693
DOI: 10.1007/S11229-008-9441-4
description: scientific article; zbMATH DE number 5625288