Third International Conference on Computability and Complexity in Analysis

November 1-5, 2006, Gainesville, Florida, USA



The conference is concerned with the theory of computability and complexity over real-valued data.

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. Unlike the well established classical theory over discrete structures, the theory of computation over continuous data is still in early stages of development, 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 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.

For this year's meeting, there will be a particular focus on effectively closed sets and on algorithmic randomness. CCA 2006 is part of the

Special Year in Logic at the University of Florida .

Scientific Program Committee

Organizing Committee

Special Invited Lectures

Invited Speakers



CCA 2006 Program


The accepted articles will be published as CCA 2006 proceedings in ENTCS (instructions and style file). Additionally a printed version (as a technical report) will be distributed at the conference.

It is planned to publish a special issue of Mathematical Logic Quarterly dedicated to the conference CCA 2006. After the conference, the participants will be invited to submit their papers for publication in this special issue. There will also be a special issue of Archive for Math Logic on the Special Year in Logic at the University of Florida which is open for CCA submissions as well. The papers will be subject to the usual refereeing process of the journals.


Authors are invited to submit a PostScript or PDF version of a paper to



Submission deadline: August 1, 2006
Notification: September 1, 2006
Camera-ready versions: September 15, 2006 (at the latest)
Tutorials: November 1-2, 2006
Main conference: November 3-5, 2006

Local Information

Some information on the conference venue, traveling and accomodation are available here:

Local Information


Participants are requested to register by September 29, 2006 following the instructions here:

Registration Information


The organizers would like to thank the National Science Foundation, as well as the Department of Mathematics, College of Liberal Arts and Sciences, and the Office of Graduate Research and Technology at the University of Florida for generous support.

CCA Steering Committee

Vasco Brattka (Cape Town, South Africa), Peter Hertling (Munich, Germany), Ker-I Ko (Stony Brook, USA), Klaus Weihrauch, chair (Hagen, Germany), Ning Zhong (Cincinnati, USA)

Further Information

For further information, please contact