Computability and Complexity in Analysis (CCA 2015)
http://www.graco.c.u-tokyo.ac.jp/~kawamura/cca2015-local/
will take place on July 12-15, 2015, in Tokyo, JAPAN.
It is strongly recommended to register and to book accommodation early!
______________________________________________________________
Accepted abstracts
Ulrich Berger, Kenji Miyamoto, Helmut Schwichtenberg and Hideki Tsuiki.
Logic for Gray code computation
Vasco Brattka and Tahina Rakotoniaina.
On the Computational Content of Ramsey's Theorem
Matthew de Brecht.
Extending continuous valuations on quasi-Polish spaces to Borel
measures
Hannes Diener and Robert Lubarsky.
Weakenings of Cauchy Convergence
Hugo Férée and Martin Ziegler.
On the Computational Complexity of Positive Linear Functionals on
C[0;1]
Cameron Freer and Jan Reimann.
The topology of universal graphons
Christine Gaßner and Pedro Francisco Valencia Vizcaíno.
Operators for BSS RAM's
Daniel Graça and Ning Zhong.
Computation of the asymptotic behavior of dynamical systems
Vassilios Gregoriades.
The Baire property holds in the projective hierarchy almost uniformly
(Abstract)
Tomohiro Katayama and Akitoshi Kawamura.
On the Image and Length of Polynomial Time Computable Curves
Akitoshi Kawamura, Florian Steinberg and Martin Ziegler.
Towards Computational Complexity Theory on Advanced Function Spaces in
Analysis
Robert Kenny.
Effective zero-dimensionality and retracts
Rutger Kuyper.
Differentiability and effective genericity
Benedikt Löwe, Hugo Nobrega and Arno Pauly.
Game characterizations and Weihrauch degrees
Kei Matsumoto and Kazushige Terui.
Coherence Spaces for Computable Analysis
Eike Neumann.
Continuous Enclosures and Best Approximations of Discontinuous
Operations
Arno Pauly.
Computability on the countable ordinals and the Hausdorff-Kuratowski
theorem
Norbert Preining.
CafeOBJ for real - using an algebraic specification language as theorem
prover for computational reals
Matthias Schröder.
A Hofmann-Mislove Theorem for Scott open sets
Matthias Schröder, Florian Steinberg and Martin Ziegler.
Average-Case Complexity of Real Functions
Shu-Ming Sun, Ning Zhong and Martin Ziegler.
On Computability of Navier-Stokes' Equation
Kazuto Yoshimura.
The Weihrauch degrees define monads
Invited Speakers
* Sicun Gao (Boston, USA)
* Alexander Kreuzer (Singapore)
* Vikram Sharma (Chennai, India)
* Kohei Suenaga (Kyoto, Japan)
Scientific Program Committee
* Andrej Bauer (Ljubljana, Slovenia)
* Stephen A. Cook (Toronto, Canada)
* Guido Gherardi (Munich, Germany)
* Daniel Graça (Faro, Portugal)
* Hajime Ishihara (Ishikawa, Japan)
* Ker-I Ko (Hsinchu, Taiwan)
* Timothy McNicholl (Ames, USA)
* André Nies (Auckland, New Zealand)
* Mariko Yasugi (Kyoto, Japan)
* Martin Ziegler, chair (Darmstadt, Germany)
Organizing Committee
* Naohi Eguchi (Chiba University, Japan)
* Kojiro Higuchi (Chiba University, Japan)
* Akitoshi Kawamura, chair (University of Tokyo, Japan)
* Kenshi Miyabe (Meiji University, Japan)
* Ryuhei Mori (Tokyo Institute of Technology, Japan)
* Hideki Tsuiki (Kyoto University, Japan)
Co-located "Workshop on Theory and Practice of Real Computation"
on Sunday, July 12, jointly organized and with tutorials/talks by:
* Zin Arai
* Akitoshi Kawamura
* Norbert Mueller
* Shin'ichi Oishi
* Siegfried M. Rump
* Martin Ziegler
http://www.graco.c.u-tokyo.ac.jp/~kawamura/cca2015-workshop/
--1401079810-2034930343-1419419213=:4284--
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
