Welcome to CCA Network!

The aim of the CCA Network is to provide some useful information for researchers working in the field of computability and complexity in analysis. In particular, we offer: CCA Network is maintained by Vasco Brattka. Please, feel free to send any kind of suggestions and comments!

CCA Steering Committee

The CCA conference series was started with a workshop in 1995 and takes place annually ever scince. The conference series is managed by the CCA Steering Committee: Founding members of the steering committee: Vasco Brattka, Peter Hertling, Ker-I Ko, Klaus Weihrauch, Ning Zhong.

Computability and Complexity in Analysis

Computability and complexity theory are two central areas of research in mathematical logic and theoretical computer science. Computability theory is the study of the limitations and abilities of computers in principle. Computational complexity theory provides a framework for understanding the cost of solving computational problems, as measured by the requirement for resources such as time and space. The classical approach in these areas is to consider algorithms as operating on finite strings of symbols from a finite alphabet. Such strings may represent various discrete objects such as integers or algebraic expressions, but cannot represent general real or complex numbers, unless they are rounded.

Most mathematical models in physics and engineering, however, are based on the real number concept. Thus, a computability theory and a complexity theory over the real numbers and over more general continuous data structures is needed. Despite remarkable progress in recent years many important fundamental problems have not yet been studied, and presumably numerous unexpected and surprising results are waiting to be detected.

Scientists working in the area of computation on real-valued data come from different fields, such as theoretical computer science, domain theory, logic, constructive mathematics, computer arithmetic, numerical mathematics and all branches of analysis. The conference provides a unique opportunity for people from such diverse areas to meet, present work in progress and exchange ideas and knowledge.

The topics of interest include foundational work on various models and approaches for describing computability and complexity over the real numbers. They also include complexity-theoretic investigations, both foundational and with respect to concrete problems, and new implementations of exact real arithmetic, as well as further developments of already existing software packages. We hope to gain new insights into computability-theoretic aspects of various computational questions from physics and from other fields involving computations over the real numbers.


CCA conferences typically include the following topics: