August 19-20, 1995
                            Hagen, Germany


Time	 Name
  	 Title of the talk
 9:00 	OPENING 
 9:15 	Jens Blanck, Department of Mathematics, Uppsala University
	Domain Representability of Metric Spaces
10:15 	Martin Hoetzel Escardo, Department of Computing, Imperial College
	PCF Extended with Real Numbers
11:15	Klaus Weihrauch, Theoretische Informatik I, FernUniversitaet Hagen
	A Foundation of Computable Analysis
12:15	Matthias Schroeder, Theoretische Informatik I, FernUniversitaet Hagen
	Topological Spaces Allowing Type 2 Complexity Theory
13:00	LUNCH
15:00	Kostas Skandalis, Department of Mathematics, University of Crete
	Program Computability over the Real Numbers
15:40	Erich Graedel, LG Mathematische Grundlagen der Informatik, RWTH Aachen 
	Klaus Meer, Lehrstuhl C fuer Mathematik, RWTH Aachen
	Descriptive Complexity Theory over the Real Numbers}
16:20	Peter Hertling, Vasco Brattka, Theoretische Informatik I, FernUni Hagen
	Feasible Real Random Access Machines
17:20	Discussion on Models for Computable Analysis
19:30   Social Event

 9:00	Ker-I Ko, Department of Computer Science, State University of NY
	Recent Progress on Complexity Theory of Real Functions
10:00	Arthur Chou, Department of Math. and Computer Science, Clark University
	Some Complexity Issues in Complex Analysis
11:00 	Markus Blaeser, Institut fuer Informatik II, Universitaet Bonn
	Uniform Computational Complexity of the Derivates of C^\infty-Functions
11:30	Norbert Mueller, Abteilung Informatik, Universitaet Trier
	Constructive Aspects of Analytic Functions
12:30	LUNCH
14:30	Marian Boykan Pour-El, School of Mathematics, University of Minnesota 
	Church's Thesis and Recursive Analysis (presented by Vasco Brattka)
15:00	Rudolf Freund, Institut fuer Computersprachen, 
   	Technische Universitaet Wien
	Ludwig Staiger, Institut fuer Informatik, Universitaet Halle-Wittenberg
	Numbers Defined by Turing Machines
15:40	Vasco Brattka, Theoretische Informatik I, FernUniversitaet Hagen
	Computable Selection in Analysis
16:20	END