CCC 2015 – Kochel

Continuity, Computability, Constructivity – From Logic to Algorithms

Georg-von-Vollmar-Akademie – Schloss Aspenstein / Kochel am See, Germany

CCC is a conference series bringing together researchers from real analysis, computability theory, and constructive mathematics. The overall aim is to apply logical methods in these disciplines to provide a sound foundation for obtaining exact and provably correct algorithms for computations with real numbers and related analytical data, which are of increasing importance in safety critical applications and scientific computation. More information about the previous conferencess can be found here.

  • Scope: The conference was a project meeting of the COMPUTAL project. It addressed the participants of the project as well as scientists working in related fields. The  conference specifically invited contributions in the areas of exact real number computation, effective topology, Scott’s domain theory, Weihrauch’s type two theory of effectivity, category-theoretic approaches to computation on infinite data, hierarchies of unsolvability, and related areas.
  • Invited Speakers:
    • Martín Escardó (Birmingham)
    • Daniel da Silva Graça (Lisbon)
    • Mathieu Hoyrup (Nancy)
    • Vassilis Gregoriades (Darmstadt)
    • Takayuki Kihara (Berkeley)
    • Thomas Powell (Innsbruck)
  • Tutorials:
    • André Nies (Auckland)
    • Olivier Bournez (Palaiseau)
  • Programme Committee:
    • Andrej Bauer (Ljubljana, Slovenia)
    • Ulrich Berger (Swansea, UK)
    • Vasco Brattka (Munich, Germany)
    • Petrus Potgieter (Unisa, Pretoria)
    • Victor Selivanov (Novosibirsk, Russia)
  • Organizing Committee:
    • Ulrich Berger
    • Peter Hertling
    • Monika Seisenberger
    • Dieter Spreen
  • For further details please have a look on the web page of the conference.



Leave a Reply