Logic List Mailing Archive

(no subject)

International Conference on
Computability and Complexity in Analysis
August 28-30, 2003, Cincinnati, USA 

http://www.informatik.fernuni-hagen.de/cca/cca2003/
                            
Scope
                            
The conference is concerned with the theory of computability and
complexity over real-valued data.
                            
Computability theory 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 a general real or complex number, unless
it is rounded.
                            
The classical theory of computation does not deal adequately with
computations that operate on real-valued data. Most computational problems
in the physical sciences and engineering are of this type, such as the
complexity of network flow problems and of dynamical and hybrid systems.
To study these types of problem, alternative models over real-valued data
and other continuous structures have been developed in recent years.
Unlike the well established classical theory of computation over discrete
structures, the theory of computation over continuous data is still in its
infancy.
                            
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, analysis, etc. 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; 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. This will require the
extension of existing computability notions to more general classes of
objects.
                            
Invited Speakers

Douglas Bridges (University of Canterbury, New Zealand)
                            
Rod Downey (Victoria University of Wellington, New Zealand)
                            
Peter Hertling (FernUniversitaet Hagen, Germany)
                            
Iraj Kalantari (Western Illinois University, USA)
                            
Vladik Kreinovich (University of Texas at El Paso, USA)
                            
Boris Kushner (University of Pittsburgh, USA)
                            
Jack Lutz (Iowa State University, USA)
                            
Klaus Weihrauch (FernUniversitaet Hagen, Germany)