[FOM] CCA 2003 - Call for Participation
Vasco Brattka
Vasco.Brattka at FernUni-Hagen.de
Wed Jul 23 11:06:13 EDT 2003
________________________________________________________________________________
C C A
2 0 0 3
International Conference on
Computability and Complexity in Analysis
August 28-30, 2003, University of Cincinnati, USA
________________________________________________________________________________
First Call for Participation
Invited Talks
1. Douglas S. Bridges (Christchurch, New Zealand)
First steps in constructive game theory
2. Rod Downey (Wellington, New Zealand)
Presenting reals
3. Peter Hertling (Duisburg-Essen, Germany)
Topological complexity of zero finding for continuous functions
4. Iraj Kalantari (Illinois, USA)
Density and Baire category in recursive topology
5. Vladik Kreinovich (Texas, USA)
Computational complexity and feasibility of data processing and interval
computations, with extension to cases when we have partial information
about probabilities
6. Boris A. Kushner (Pittsburgh, USA)
The centenary of A.A. Markov, Jr.;
His personality, his constructive mathematics
7. Jack Lutz (Ames, USA)
Effective fractal dimensions
8. Klaus Weihrauch (Hagen, Germany)
Continuity in Computable Analysis
Contributed Talks
1. Andrej Bauer and Alex Simpson
Locally non-compact spaces and continuity principles
2. Vasco Brattka
Effective Borel measurability and reducibility of functions
3. Cristian S. Calude and Ludwig Staiger
Generalisations of disjunctive sequences
4. Douglas Cenzer and Jeffrey B. Remmel
Index sets for computable real functions
5. Arthur W. Chou and Ker-I Ko
On the complexity of finding shortest paths in a two-dimensional domain
6. Abbas Edalat and Dirk Pattinson
Initial value problems in domain theory
7. Daniel Silva Graca
Computability via analog circuits
8. Armin Hemmerling
Characterizations of the class Delta_2^{ta} over Euclidean spaces
9. Elham Kashefi
Quantum domain theory - definitions and applications
10. Bjorn Kjos-Hanssen, Andre Nies and Frank Stephan
On a question of Ambos-Spies and Kucera
11. Daren Kunkle
Computability on spaces of integrable functions
12. Branimir Lambov
A two-layer approach to the computability and complexity of real
functions
13. Marian B. Pour-El and Ning Zhong
Boundary regularity and computability
14. Matthias Schroeder
Spaces allowing type-2 complexity theory revisited
15. Guohua Wu
Regular reals
16. Xizhong Zheng and Robert Rettinger
h-Monotonically computable real numbers
17. Martin Ziegler
Computable operators on regular sets
Scientific Program Committee
Vasco Brattka (Hagen, Germany)
Douglas Cenzer (Gainesville, USA)
Rod Downey (Wellington, New Zealand)
Martin Escardo (Birmingham, UK)
Ker-I Ko (Stony Brook, USA)
Norbert Mueller (Trier, Germany)
Marian Pour-El (Minneapolis, 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 (Hamilton, Canada)
Local Organizing Committee
Kenneth Meyer (Cincinnati, USA)
Dieter Schmidt (Cincinnati, USA)
Bingyu Zhang (Cincinnati, USA)
Ning Zhong, chair (Cincinnati, USA)
Registration
Registration and application for financial support is possible
via the conference webpage (see below).
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
The National Science Foundation;
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, female mathematicians and female
computer scientists, and members of underrepresented groups.
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.
________________________________________________________________________________
More information about the FOM
mailing list