[FOM] CCA 2005 - Second Call for Papers
Peter Hertling
hertling at informatik.unibw-muenchen.de
Fri Feb 25 06:51:24 EST 2005
________________________________________________________________
Second Announcement and Call for Papers
________________________________________________________________
C C A 2 0 0 5
Second International Conference on
Computability and Complexity in Analysis
August 25-29, 2005, Kyoto, Japan
25-26: Satellite seminars
27-29: Main conference
http://cca-net.de/cca2005
________________________________________________________________
Submissions:
Authors are invited to submit a PostScript or PDF version of
a paper to the email address provided on the web site of the
conference.
Dates:
Submission: May 1, 2005
Notification: June 5, 2005
Camera-ready version: July 3, 2005
Satellite seminars and reception: August 25-26, 2005
Main conference: August 27-29, 2005
Scope
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. Unlike the
well established classical theory over discrete structures,
the theory of computation over continuous data is still in
its infancy, 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 detected.
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 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. They also include
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.
Scientific Program Committee:
Vasco Brattka (Cape Town, South Africa)
Peter Hertling, chair (Munich, Germany)
Hajime Ishihara (Ishikawa, Japan)
Iraj Kalantari (Macomb, USA)
Ker-I Ko (Stony Brook, USA)
Vladik Kreinovich (El Paso, USA)
Jack H. Lutz (Ames, USA)
Joseph S. Miller (Bloomington, USA)
Robert Rettinger (Hagen, Germany)
Matthias Schröder (Edinburgh, Scotland)
Alex Simpson (Edinburgh, Scotland)
Klaus Weihrauch (Hagen, Germany)
Atsushi Yoshikawa (Kyushu, Japan)
Xizhong Zheng (Cottbus, Germany)
Ning Zhong (Cincinnati, USA)
Martin Ziegler (Odense, Denmark)
Organizing Committee:
Hiroyasu Kamo (Nara, Japan)
Takakazu Mori (Kyoto, Japan)
Izumi Takeuti (Toho, Japan)
Hideki Tsuiki, chair (Kyoto, Japan)
Yoshiki Tsujii (Kyoto, Japan)
Mariko Yasugi (Kyoto, Japan)
Invited Speakers
Vasco Brattka (Cape Town, South Africa)
Masami Hagiya (Tokyo, Japan)
Daisuke Takahashi (Waseda, Japan)
Proceedings
A technical report including the accepted papers will be
distributed at the conference.
It is planned to publish a special issue of the
Journal of Complexity dedicated to the conference.
After the workshop, the participants will be invited to
submit their papers for publication in this special issue.
The papers will be subject to the usual refereeing process
of the journal.
Satellite Seminars
On August 25 and 26, 2005, there will be satellite seminars
that will consist of introductory lectures to CCA and
related areas. The following speakers have agreed to give
introductory lectures (topic in brackets):
Andrej Bauer (Realizability for constructive and
computable mathematics)
Martin Escardo (Synthetic topology of computational spaces)
Peter Hertling (Computable analysis via representations)
Hideyuki Suzuki (Analog computation)
Mariko Yasugi (Computable versions of basic theorems in
functional analysis)
Atsushi Yoshikawa (Computable versions of basic theorems in
functional analysis)
More detailed information will soon be available on the
web site of the conference.
Venue
The conference will be held on the Yoshida Campus of
Kyoto University.
Kyoto was the imperial capital of Japan for over 1000 years
until 1867. It has many famous temples, shrines, national
treasures, and festivals, and it is still the cultural
center of Japan. Kyoto is also known as an academic city
with many universities and research institutes.
Local Information
Kyoto is about 100 km north-east of Kansai International
Airport.
Travel and on-site information will soon be available on
the web site of the conference.
Support:
We expect that some financial support will be available to
cover part of the travel and hotel expenses of some of the
speakers. Details will be announced soon.
The conference is supported by the Graduate School of Human
and Environmental Studies, Kyoto University.
________________________________________________________________
More information about the FOM
mailing list