December 11(Saturday)

10:00-10:50 T. Mori: Effective convergence of Fine computable
functions

11:00-11:50 V. Brattka: The Hahn-Banach Theorem and its Impact on
Computable Analysis

12:00-12:50 S. Hayashi: LCM and games

13:00-14:30 Lunch

14:30-15:00 Free discussion

15:00-15:50 P. Hertling: Topological Complexity of Zero Finding for
Continuous Functions

16:00-16:30 Free discussion

16:30-17:00 Clearing

December 12(Sunday)

10:00-10:50 M. Yasugi: Effective sequence of uniformities

11:00-11:50 P.Hertling: Is the Mandelbrot set computable?

12:00-13:00 Lunch

13:00-13:50 T. Yamazaki: Some results on higher order reverse
mathematics

14:00-14:50 A. Yoshikawa: Questions and problems from a naive observer
of the field

15:30-16:30 H.Kamo: Computability of Urysohn's Universal Metric
Space

16:30-17:00 Clearing up

CC-seminar 2004-1 (supported by Kayamori Foundations of Information Sciences)

November 21(Sunday)

Kyoto Sangyo University, DaisanKenkyushitutou, 3F Meeting Room

12:30-14:00 Professor Klaus Weihrauch (FernUniversitaet Hagen)

14:00-15:30 Professor Ulrich Kohlenbach (Darmstadt University of
Technology)

Title and Abstract

Weihrauch: “Computing over the reals: Numerical Analysis and Computable
Analysis”

We compare the Blum/Shub/Smale (BSS) model of computation which isused
in "naive"

numerical programming, the Grzegorczyk/Lacombe (GL) model of
computation and Interval Analysis.

We show that the non-realistic BSS programs can be converted into
GL-computable multi-functions

if the exact tests are replaced by approximate multi-valued tests. We
introduce comutational complexity

in the GL model and discuss a trade-off between time? complexity and
input lookahead.

Kohlenbach: "Proof Theory and Nonlinear Functional Analysis"

Abstract: We will discuss some recent results from logic which

guarantee the extractability of new information from large

classes of proofs in functional analysis. This new information
typically

is both of qualitative nature (independence of solutions from
certain

parameters, weakenings of hypotheses) as well as quantitative
computational

nature (explicit effective bounds). To indicate the realm of

applications we will present some new results in the area of fixed
point

theory which recently have been obtained in this way.

* The Seventh Asian Logic Conference (ACL)

Year:1999

Place: Taiwan

Representative: Professor Tung

Home page: http://www.sinica.edu.tw/math/html/workshop/alc99/alc99.html

The 8th ALC, Chonqing, China, August 29-September2,2002

* CCA Workshop in Brno

* CCA2000(Computability and Complexity in Analysis, Swanseq)

* CCA2002(Computability and Complexity in Analysis, Malaga,Spain)

International Mathematica Symposium (IMS'99)

IMS'99/Papers

*Third International Colloquium on Words, Languages and Combinatorics

March 14-18, 2000, Kyoto, Japan

yasugi@cc.kyoto-su.ac.jp Last modified: May 22, 1998