Corpus ID: 16352934

A Simple Introduction to Computable Analysis

@inproceedings{Ullmann2009ASI,
  title={A Simple Introduction to Computable Analysis},
  author={H. Ullmann and Grzegorczyk Grz and H. Hau},
  year={2009}
}
  • H. Ullmann, Grzegorczyk Grz, H. Hau
  • Published 2009
  • 1 1 Introduction During the last 60 years an extensive theory of computability and computational complexity has been developed (see e.g. Rogers Rog 67], Odifreddi Odi 89], Weih-rauch h W ei 87], Hopcroft and Ullmann HU 79], Wagner and Wechsung WW 86]). Without doubt this \Type 1 theory" models the behaviour of real world computers for computations on discrete sets like natural numbers, nite words, nite graphs etc. quite adequately. A large part of computers, however, is used for solving… CONTINUE READING
    Dynamics and abstract computability: Computing invariant measures
    • 33
    • Open Access
    Type two computability of social choice functions and the Gibbard-Satterthwaite theorem in an infinite society
    • 4
    • Open Access
    An extension of chaotic probability models to real-valued variables
    • 4
    • Open Access
    Backward induction for repeated games
    • 1
    • Open Access
    Computability and Tiling Problems
    Computability of Simple Games: A Complete Investigation of the Sixty-Four Possibilities

    References

    Publications referenced by this paper.
    SHOWING 1-2 OF 2 REFERENCES
    Ernst: Nicht k onstruktiv beweisbare S atze der Analysis Type 2 recursion theory
    • 1949
    Klaus: The degrees of Discontinuity of some translators between representations of the real numbers, Informatik{Berichte Nr
    • 1992