Numéro
Quadrature
Numéro 72, Avril-Juin 2009
Page(s) 36 - 40
Section Analyse
DOI https://doi.org/10.1051/quadrature/2009001
Publié en ligne 25 mars 2009
  1. O. Aberth, Review: M.B. Pour-El et J.I. Richards, "Computability in Analysis and Physics" [7], J. Symbolic Logic 56 (1991) 749–750. [CrossRef]
  2. R. Cori et D. Lascar, Logique mathématique, Vol. 2, Dunod, 2003.
  3. A. Grzegorczyk, "Computable functionals", Fundam. Math. 42 (1955) 168–202.
  4. A. Grzegorczyk, "On the definitions of computable real continuous functions", Fundam. Math. 44 (1957) 61–71.
  5. S.C. Kleene, Introduction to metamathematics, North-Holland, 1952.
  6. A. Mostowski, "On computable sequences", Fundam. Math. 44 (1957) 37–51.
  7. M.B. Pour-El et J.I. Richards, Computability in Analysis and Physics, Springer-Verlag, 1989.
  8. H.G. Rice, "Recursive real numbers", Proc. Amer. Math. Soc. 5 (1954) 784–791. [CrossRef] [MathSciNet]
  9. E. Specker, "Nicht konstruktiv beweisbare Sätze der Analysis", J. Symbolic Logic 14 (1949).
  10. A.M. Turing, "On computable numbers, with an application to the Entscheidungsproblem", Proc. Lond. Math. Soc. 42 (1936–1937) 230–265.
  11. K. Weihrauch, Computable analysis, Springer-Verlag, 2000.
  12. P. Wolper, Introduction à la calculabilité, Dunod, troisième édition, 2006.