Other presentations

  1. Formal languages and computable semantics for continuous mathematics

    In this talk I will first outline Weihrauch's computable analysis, which gives a framework for discussing computability in topology, geometry and analysis based on type-two recursive function theory. I will then discuss some possibilities for a formal language for computable continuous mathematics. Ideally, such a language should be expressive enough …

    read more

Page 1 / 1

hosted by