Eighth International Conference on Computability and Complexity in Analysis, Cape Town, South Africa
31 January 2011 - 31 January 2011
South Africa
The Eighth International Conference on Computability and Complexity in Analysis will be held from 31 January to 4 February 2011 in Cape Town, South Africa.
Computability and complexity theory are two central areas of research in mathematical logic and theoretical computer science. The former is the study of the limitations and abilities of computers in principle. Computational complexity theory, on the other hand, 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 two 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. This means that theories on computability theory and the real numbers and more general continuous data structures are 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.
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 will be an opportunity for people from such diverse areas to meet, present work in progress and exchange ideas and knowledge.For further information, please visit: http://cca-net.de/cca2011/(opens in new window)
Computability and complexity theory are two central areas of research in mathematical logic and theoretical computer science. The former is the study of the limitations and abilities of computers in principle. Computational complexity theory, on the other hand, 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 two 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. This means that theories on computability theory and the real numbers and more general continuous data structures are 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.
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 will be an opportunity for people from such diverse areas to meet, present work in progress and exchange ideas and knowledge.For further information, please visit: http://cca-net.de/cca2011/(opens in new window)