Logical Methods pp 162-177 | Cite as

# Effective Real Dynamics

- 2 Citations
- 160 Downloads

## Abstract

The study of computability in analysis has a long history, going back to the papers of Lacombe [6] in the 1950’s. There has been much work on the connection between recursive function theory and computable analysis. One key result which we will use here is a theorem of Nerode’s from [7] that the existence of a recursive continuous function mapping a real a to a real *b* implies that *b* is truth-table reducible to *a*. Another connection which we will use is given in the papers of Soare [11, 12] on recursion theory and Dedekind cuts, where the effectively closed real intervals are characterized. One important aspect of computable analysis is the search for effective versions of classical theorems. This is in the spirit of the well-known Nerode program for applying recursion theory to mathematics. As an example, if *K* is a closed subset of the real line ℜ, then the distance function δ_{K’} defined by δ_{K}(*x*) = min{|*x* − *y*|: *y* ∈ *K*} is continuous. Thus the question arises whether an effectively closed set *K* has an effectively continuous (i.e., recursive) distance function. (In general, the answer is no.) Closed sets play an important rôle in the study of analysis. For example, the set of zeros of a continuous function *F* is a closed set, as is the set of fixed points of *F*. We are particularly interested in the rôle of effectively closed, or Π^{0} _{1} classes. Π_{1} ^{0} classes are important in the applications of recursion theory and have been studied extensively. (See [4] for a survey of results.)

## Preview

Unable to display preview. Download preview PDF.

## References

- [1]Block, L.S. and W.A. Coppel [1992],
*Dynamics in One Dimension*. Lecture Notes in Mathematics, vol.*1513*, Springer-Verlag.Google Scholar - [2]Blum, L., M. Shub and S. Smale [1989], On a theory of computation and complexity over the real numbers.
*Bull. Amer. Math. Soc. 21*, 1–46.MathSciNetzbMATHCrossRefGoogle Scholar - [3]Cenzer, D., P. Clote, R. Smith, R. Soare and S. Wainer [1986], Members of countable Π
^{0}_{1}, classes.*Ann. Pure and Appl. Logic 31*, 145–163.MathSciNetzbMATHCrossRefGoogle Scholar - [4]Cenzer, D. and J.B. Remmel, Π
^{0}_{1}classes in mathematics. To appear in*Recursive Mathematics*, ed. A. Nerode and J.B. Remmel.Google Scholar - [5]Devaney, R.L. [1986],
*An introduction to Chaotic Dynamical Systems*. Benjamin/Cummings.Google Scholar - [6]Lacombe, D. [1955], Extension de la notion de fonction récursive aux fonctions d’une ou plusieurs variables réelles, I, II, III.
*Comptes Rendus Hebdomaires des Sciences 240*, Paris, 2478–2480;*241*, 13–14, 151–153.MathSciNetzbMATHGoogle Scholar - [7]Nerode, A. [1957], General topology and partial recursive functionals.
*Summaries of talks presented at the Summer Institute for Symbolic Logic*, Cornell University, 247–251.Google Scholar - [8]Nerode, A. and W.-Q. Huang [1985], Application of pure recursion theory to computable analysis (Chinese).
*Acta Mathematica Sinica*,*28*, 625–636.MathSciNetzbMATHGoogle Scholar - [9]Pour-El, M.B. and J.I. Richards [1989],
*Computability in Analysis and Physics*. Perspectives in Mathematical Logic, Springer-Verlag.Google Scholar - [10]Rogers, H.J. [1967],
*Theory of Recursive Functions and Effective Computability*. McGraw-Hill.Google Scholar - [11]Soare, R. [1969], Recursion theory and Dedekind cuts.
*Trans, of Amer. Math. Soc. 139*, 271–294.MathSciNetGoogle Scholar - [12]Soare, R. [1969], Cohesive sets and recursively enumerable Dedekind cuts.
*Pacific J. Math. 31*, 215–231.MathSciNetzbMATHCrossRefGoogle Scholar