Logic List Mailing Archive

*Change of Date* and 2nd CfP: CCA 2006 (Computability and Complexity in Analysis), Gainesville FL, November 2006

#==========================#
                      #                          #
                      #      CHANGE OF DATE      #
                      #                          #
                      #==========================#


                          Second Call for Papers

                                CCA 2006

                     Third International Conference
                                   on
                  COMPUTABILITY AND COMPLEXITY IN ANALYSIS


                           November 1-5, 2006,
                         Gainesville, Florida, USA

                         http://cca-net.de/cca2006/

                                 DATES
               Submission deadline:   July 2, 2006
               Notification:          August 1, 2006
               Camera-ready version:  September 1, 2006
               Tutorials:             November 1-2, 2006
               Main conference:       November 3-5, 2006


                               SUBMISSIONS
Authors are invited to submit a PostScript or PDF version of a paper to

                    cca-submission@FernUni-Hagen.de


                                  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 early stages of development, 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.

For this year's meeting, there will be a particular focus on effectively
closed sets and on algorithmic randomness. CCA 2006 is part of the
          Special Year in Logic at the University of Florida.
                http://www.math.ufl.edu/~jal/logicyear/


                     SCIENTIFIC PROGRAM COMMITTEE
     * Andrej Bauer (Ljubljana, Slovenia)
     * Arthur Chou (Worcester, USA)
     * Rod Downey (Wellington, New Zealand)
     * Abbas Edalat (London, UK)
     * Denis Hirschfeldt (Chicago, USA)
     * Iraj Kalantari (Macomb, USA)
     * Hiroyasu Kamo (Nara, Japan)
     * Joseph S. Miller (Storrs, USA)
     * Anil Nerode (Ithaca, USA)
     * Jeff Remmel (San Diego, USA)
     * Robert Rettinger (Hagen, Germany)
     * Klaus Weihrauch, chair (Hagen, Germany)


                        ORGANIZING COMMITTEE
     * Paul Brodhead (Gainesville, USA),
     * Douglas Cenzer, chair (Gainesville, USA), cenzer@ufl.edu
     * Rick Smith (Gainesville, USA)

                          INVITED SPEAKERS
     * Douglas Bridges (Christchurch, New Zealand)
     * Rod Downey (Wellington, New Zealand)
     * Edward Griffor (Michigan, USA)
     * Anil Nerode (Ithaca, USA)
     * Ker-I Ko (Stony Brook, USA)

                             TUTORIALS
     * Denis Hirschfeldt (Algorithmic Randomness)
     * Rebecca Weber & Stephen Simpson (Effectively Closed Sets)
     * Vasco Brattka (Computable Analysis)

                            PROCEEDINGS
A technical report including the accepted papers will be distributed at
the conference. It is planned to publish a special issue of a journal
dedicated to the conference. After the conference, 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.

                         FURTHER INFORMATION
     * Klaus Weihrauch: Klaus.Weihrauch@FernUni-Hagen.de or
     * Douglas Cenzer: cenzer@ufl.edu.
                     http://cca-net.de/cca2006/

                        CCA STEERING COMMITTEE
Vasco Brattka (Cape Town, South Africa), Peter Hertling (Munich, Germany),
Ker-I Ko (Stony Brook, USA), Klaus Weihrauch, chair (Hagen, Germany),
Ning Zhong (Cincinnati, USA)