1-5 November 2006, Computability and Complexity in Analysis (CCA 2006), Gainesville, Florida, USA

The conference is concerned with the theory of computability and complexity over real-valued data. 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.

For this year's meeting, there will be a particular focus on effectively closed sets and on algorithmic randomness.

For more information, see http://cca-net.de/cca2006/