[FOM] CCA 2003 - Second Announcement and Call for Papers

[Vasco Brattka]

________________________________________________________________________________

   C  C  A
   2 0 0 3

   International Conference on
   Computability and Complexity in Analysis 

   August 28-30, 2003, University of Cincinnati, USA
________________________________________________________________________________


   Second Announcement and Call for Papers


   Invited Speakers

   Douglas Bridges          (Christchurch, New Zealand)
   Rod Downey               (Wellington, New Zealand)
   Peter Hertling           (Hagen, Germany)
   Iraj Kalantari           (Western Illinois, USA)
   Vladik Kreinovich        (Univ. of Texas, USA)
   Boris Kushner            (Pittsburgh, USA)
   Jack Lutz                (Iowa State, USA)
   Klaus Weihrauch          (Hagen, Germany)


   Scientific Program Committee

   Vasco Brattka            (Hagen, Germany)
   Douglas Cenzer           (Univ. of Florida, USA)
   Rod Downey               (Wellington, New Zealand)
   Martin Escardo           (Birmingham, UK)
   Ker-I Ko                 (Stony Brook, USA)
   Norbert Mueller          (Trier, Germany)
   Marian Pour-El           (Minnesota, USA)
   Dieter Schmidt           (Cincinnati, USA)
   Matthias Schroeder       (Hagen, Germany)
   Viggo Stoltenberg-Hansen (Uppsala, Sweden)
   Klaus Weihrauch, chair   (Hagen, Germany)
   Mariko Yasugi            (Kyoto Sangyo, Japan)
   Jeffery Zucker           (McMaster, Canada)
 

   Local Organizing Committee

   Kenneth Meyer            (Cincinnati, USA)
   Dieter Schmidt           (Cincinnati, USA)
   Bingyu Zhang             (Cincinnati, USA)
   Ning Zhong, chair        (Cincinnati, USA)


   Submissions

   Authors are invited to submit PostScript versions of papers to

   cca at fernuni-hagen.de


   Deadlines

   Submission deadline:   June  2, 2003
   Notification:          June 30, 2003
   Camera-ready versions: July 14, 2003
 

   Registration

   Registration and application for financial support is possible 
   via the conference webpage (see below).
   The deadline for applying for financial support is May 1, 2003.


   Information

   For further information please contact
 
   Vasco Brattka (Vasco.Brattka at FernUni-Hagen.de) or
   Ning Zhong    (Ning.Zhong at uc.edu)


   Webpage

   http://www.informatik.fernuni-hagen.de/cca/cca2003/


   Funding Opportunities 

   The conference is partially supported by the 
   Taft Memorial Foundation of the University of Cincinnati;
   the Institute for Mathematics and Applications (IMA); 
   the Ohio Board of Regents; 
   the Clermont College, 
   the Department of Electrical and Computer Engineering and Computer Science, 
   and the Department of Mathematical Sciences 
   of the University of Cincinnati. 
   Limited funds are available to conference participants - in particular, 
   to young researchers and Ph.D. students.  
   The conference is also sponsored by 
   the Association for Symbolic Logic (ASL).
   Financial support from ASL may be available for student members of ASL
   (see the conference webpage for a link). 


   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. 


   Proceedings 

   It is planned to publish a special issue of Mathematical Logic Quarterly
   dedicated to the conference.

________________________________________________________________________________