Universiteit van Amsterdam


Institute for Logic, Language and Computation

Please note that this newsitem has been archived, and may contain outdated information or links.

31 Jan-4 February 2011, Computability and Complexity in Analysis (CCA 2011), Cape Town, South Africa

Date: 31 Jan-4 February 2011
Location: Cape Town, South Africa
Deadline: 1 October 2010

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

For more information, see http://cca-net.de/cca2011/. CCA-2011 is co-located with CCR-2011.

The Programme Committee cordially invites all researchers to submit their papers for presentation. Submission deadline: October 1, 2010 (Abstracts only!).

Please note that this newsitem has been archived, and may contain outdated information or links.