Computable chaos

Philosophy of Science 59 (2):263-275 (1992)
Abstract
Some irrational numbers are "random" in a sense which implies that no algorithm can compute their decimal expansions to an arbitrarily high degree of accuracy. This feature of (most) irrational numbers has been claimed to be at the heart of the deterministic, but chaotic, behavior exhibited by many nonlinear dynamical systems. In this paper, a number of now classical chaotic systems are shown to remain chaotic when their domains are restricted to the computable real numbers, providing counterexamples to the above claim. More fundamentally, the randomness view of chaos is shown to be based upon a confusion between a chaotic function on a phase space and its numerical representation in Rn
Keywords No keywords specified (fix it)
Categories (categorize this paper)
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: 10,142
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Citations of this work BETA
Similar books and articles
Analytics

Monthly downloads

Added to index

2009-01-28

Total downloads

19 ( #81,130 of 1,095,546 )

Recent downloads (6 months)

4 ( #43,745 of 1,095,546 )

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.