CCA 2006 SCHEDULE

Tuesday, October 31: Registration in LITTLE 358

Wednesday, November 1 (Reitz Union 282)

9-10: coffee and welcome
10-11: Rebecca Weber, Tutorial on Pi-0-1 Classes -- Slides
11-12: Vasco Brattka, Tutorial on Computability and Complexity in Analysis -- Slides
12-1:30: lunch (Registration in 358 Little)
1:30-2:30 Denis Hirschfeldt, Tutorial on Algorithmic Randomness
2:30-3:30: Stephen G. Simpson, Tutorial on Mass Problems -- Slides
3:30-4: coffee
4-5: Robert Soare, Invited History Lecture, History and Concepts of Computability -- Slides -- Photo

Thursday, November 2 (Reitz Union 282)

8-8:30: coffee
8:30-9:30: Brattka tutorial Part II
9:30-10:30: Weber tutorial Part II
10:30-11: break
11-12: Hirschfeldt tutoria Part II

12-2 lunch (Registration in 358 Little)

2-3: Simpson tutorial Part II
3-3:30: Peter Hinman, Medvedev degrees of generalized r.e. separating classes -- Slides
3:30-4: coffee
4-5: Brattka tutorial Part III
5-5:30: Paul Brodhead, Enumerations of effectively closed sets -- Slides

Reception, LITTLE 358, 6pm to 8pm (Registration also)

Friday, November 3 (Reitz Union 282)

8-8:30: coffee
8:30-9:30: Hirschfeldt tutorial Part III
9:30-10: Laurent Bienvenu, Effective randomness for computable probability measures -- Slides
10-10:30: break
10:30-11: Jeffrey B. Remmel, Random Continuous Functions -- Slides
11-11:30: George Barmpalias, Low for Random and Domination -- Slides
11:30-12: Timothy H. McNicholl, Computability and the Implicit Function Theorem

12-2: lunch

2-2:30: Jack H. Lutz, Dimensions of Points in Self-Similar Fractals
2:30-3: Christoph Spandl, Computing the Topological Entropy of Shifts
3-3:30: Volker Bosserhoff, Computability of Solutions of Operator Equations
3:30-4: coffee
4-5: Anil Nerode, Ninth Annual Ulam Colloquium, New Vistas in Control of Complex Systems: Logical and geometric aspects of hybrid control and their application to real time systems

Saturday, November 4 (Little Hall 339/Fine Arts Building 105)

8-8:30: coffee (Little 339)
8:30-9:30: Edward Griffor, Invited Talk, Recursion and Control -- Slides
9:30-10: Michael Bukatin, Partial Metrics and Quantale-valued Sets -- Slides
10-10:30 break
10:30-11: Xizhong Zheng, Classification of Computable Approximations by Divergence Boundings -- Slides
11-11:30: Qingliang Chen, Primitive Recursiveness of Real Numbers under Different Representations -- Slides
11:30-12: Martin Ziegler, Revising Type-2 Computation and Degrees of Discontinuity -- Slides -- HALTING PROGRAM

lunch: 12--2

2-2:30: Ning Zhong, Computable Analysis of the Abstract Cauchy Problem in a Banach Space and Its Applications (I)
2:30-3: Ruth Dillhage, Computability of Compact Operators on Computable Banach Spaces -- Slides
3-3:30: Kerry Ojakian, The methods of approximation and lifting in real computation -- Slides
3:30-4: break
4-5: Douglas Bridges, Invited Talk, Looking in Reverse at Specker's Theorem and Continuity -- Slides
5-5:30: Robert S. Lubarsky, On the Cauchy Completeness of the Constructive Cauchy Reals

Conference Dinner: 7-9, Reitz Union Arredondo Room

Sunday, November 5 (Little Hall 339/FAB 105)

8am: coffee
8:30-9:30: Ker-I Ko, Invited Talk, Jordan Curves with Polynomial Inverse Moduli of Continuity -- Slides
930-10: Fuxiang Yu, On the Complexity of the Pancake Problem -- Slides
10-10:30: break
1030-11: Klaus Weihrauch, Computable Riesz Representation for the Dual of C[0;1] -- Slides
11-1130: Tanja Grubba, On Computable Metrization -- Slides

11:30-1: LUNCH

1-2: Rod Downey, Invited talk, Lowness Properties, Again -- Slides
2-2:30: Johanna Franklin, Schnorr Trivial Reals: A Construction

3-7: EXCURSION TO CEDAR KEY (Dinner)

POSTER SESSION

THE END