CFP: Ninth International Conference on Computability and Complexity in Analysis

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. 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.

Topics

• Computable analysis
• Complexity on real numbers
• Constructive analysis
• Domain theory and analysis
• Theory of representations
• Computable numbers, subsets and functions
• Randomness and computable measure theory
• Models of computability on real numbers
• Realizability theory and analysis
• Reverse analysis
• Real number algorithms
• Implementation of exact real number arithmetic

Submissions Authors of contributed papers are invited to submit a PDF version of an extended abstract (typically 10-12 pages) on the following web page:

• https://www.easychair.org/conferences/?conf=cca2012

Dates

Submission deadline: April 1, 2012
Notification of authors: May 6, 2012
Final version: May 27, 2012

For further information, please contact

• Klaus Weihrauch, chair of the Programme Committee, [email protected] (for submissions)
• Arno Pauly, chair of the Organising Committee, [email protected] (for local information)