Back to Program Overview

 

 
 
  Workshops/Tutorials
Registration form
    MSWord | PDF | PS

Membership application form
    MSWord | PDF | PS

Enquiries

      General

      Scientific aspects

 
 

 

 

 

Computational Prospects of Infinity
(20 Jun - 15 Aug 2005)

Organizing Committee · Confirmed Visitors · Overview · Activities · Membership Application

Recursion Theory

Schedule of Talks and Tutorials

Week 1 · Week 2 · Week 3 · Week 4

 

Monday, 18 Jul 2005

09:30am - 10:30am

Tutorial: Algorithmic randomness (Lecture 1)
Rod Downey, Victoria University of Wellington, New Zealand
  Lecture notes: PDF...   Presentation slides: PDF...

10:30am - 11:00am

--- Coffee Break ---

11:00am - 12:00nn

 

12:00nn - 02:30pm

--- Lunch Break ---

02:30pm - 03:30pm

Process on the c.e. sets: Improving and proving the Slaman-Woodin conjecture
Peter Cholak, University of Notre Dame, USA
    Presentation slides: PDF...

03:30pm - 04:00pm

--- Coffee Break ---

04:00pm - 05:00pm

A 1-generic degree with a strong minimal cover
Masahiro Kumabe, University of the Air, Japan

Tuesday, 19 Jul 2005

09:30am - 10:30am

Tutorial: Algorithmic randomness (Lecture 2)
Rod Downey, Victoria University of Wellington, New Zealand
  Lecture notes: PDF...   Presentation slides: PDF...

10:30am - 11:00am

--- Coffee Break ---

11:00am - 12:00nn

 

12:00nn - 02:30pm

--- Lunch Break ---

02:30pm - 03:30pm

Properly $Sigma^0_2$ sets and enumeration reducibility
Andrea Sorbi, University of Siena, Italy

03:30pm - 04:00pm

--- Coffee Break ---

04:00pm - 05:00pm

 

Wednesday, 20 Jul 2005

09:30am - 10:30am

Tutorial: Algorithmic randomness (Lecture 3)
Rod Downey, Victoria University of Wellington, New Zealand
  Lecture notes: PDF...   Presentation slides: PDF...

10:30am - 11:00am

--- Coffee Break ---

11:00am - 12:00nn

 

12:00nn - 02:30pm

--- Lunch Break ---

02:30pm - 03:30pm

 

03:30pm - 04:00pm

--- Coffee Break ---

04:00pm - 05:00pm

 

Thursday, 21 Jul 2005

09:30am - 10:30am

Tutorial: Definability of the Jump (Lecture 1)
Ted Slaman, University of California, Berkeley, USA

10:30am - 11:00am

--- Coffee Break ---

11:00am - 12:00nn

 

12:00nn - 02:30pm

--- Lunch Break ---

02:30pm - 03:30pm

Tutorial: Algorithmic randomness (Lecture 4)
Rod Downey, Victoria University of Wellington, New Zealand
  Lecture notes: PDF...   Presentation slides: PDF...

03:30pm - 04:00pm

--- Coffee Break ---

04:00pm - 05:00pm

Eliminating concepts: K-trivial equals low for random
André Nies, University of Auckland, New Zealand
    Presentation slides: PDF...

Friday, 22 Jul 2005

09:30am - 10:30am

Tutorial: Definability of the Jump (Lecture 2)
Ted Slaman, University of California, Berkeley, USA

10:30am - 11:00am

--- Coffee Break ---

11:00am - 12:00nn

 

12:00nn - 02:30pm

--- Lunch Break ---

02:30pm - 03:30pm

Tutorial: Algorithmic randomness (Lecture 5)
Rod Downey, Victoria University of Wellington, New Zealand
  Lecture notes: PDF...   Presentation slides: PDF...

03:30pm - 04:00pm

--- Coffee Break ---

04:00pm - 05:00pm

Recent results on lowness properties
André Nies, University of Auckland, New Zealand

« Back...

Week 1 · Week 2 · Week 3 · Week 4

 

Monday, 25 Jul 2005

09:30am - 10:30am

Self-embeddings of computable trees
Manuel Lerman, University of Connecticut, USA

10:30am - 11:00am

--- Coffee Break ---

11:00am - 12:00nn

On decisive and non U-shaped learning
Frank Stephan, National University of Singapore, Singapore
    Presentation slides: PDF...

12:00nn - 02:30pm

--- Lunch Break ---

02:30pm - 03:30pm

Ideals in computable rings
Joseph Roy Mileti, University of Chicago, USA

03:30pm - 04:00pm

--- Coffee Break ---

04:00pm - 05:00pm

Some properties for c.e. reals in the SW-degrees
Hong Lu, Nanjing University, China
    Presentation slides: PDF...

Tuesday, 26 Jul 2005

09:30am - 10:30am

Tutorial: Definability of the Jump (Lecture 3, part 1)
Ted Slaman, University of California, Berkeley, USA

10:30am - 11:00am

--- Coffee Break ---

11:00am - 12:00nn

Tutorial: Definability of the Jump (Lecture 3, part 2)
Ted Slaman, University of California, Berkeley, USA

12:00nn - 02:30pm

--- Lunch Break ---

02:30pm - 03:30pm

A new combinatorial principle related to Ramsey's theorem for pairs?
Steffen Lempp, University of Wisconsin, Madison, USA

03:30pm - 04:00pm

--- Coffee Break ---

04:00pm - 05:00pm

Indecomposable linear orderings and hypearithmetic analysis
Antonio Montalban, Cornell University, USA
    Presentation slides: PDF...

Wednesday, 27 Jul 2005

 

No talks scheduled...

Thursday, 28 Jul 2005

09:30am - 10:30am

Tutorial: Definability of the Jump (Lecture 4, part 1)
Ted Slaman, University of California, Berkeley, USA

10:30am - 11:00am

--- Coffee Break ---

11:00am - 12:00nn

Tutorial: Definability of the Jump (Lecture 4, part 2)
Ted Slaman, University of California, Berkeley, USA

12:00nn - 02:30pm

--- Lunch Break ---

02:30pm - 03:30pm

An ordering on c.e. sets based on their settling times
Barbara F. Csima, University of Waterloo, Canada

03:30pm - 04:00pm

--- Coffee Break ---

04:00pm - 05:00pm

Uniform almost everywhere domination
Peter Cholak, University of Notre Dame, USA
    Presentation slides: PDF...    Paper: PDF...

Friday, 29 Jul 2005

09:30am - 10:30am

Intial segments, rigidity and biinterpretability in the hyperdegrees
Richard Shore, Cornell University, USA

10:30am - 11:00am

--- Coffee Break ---

11:00am - 12:00nn

Cupping computably enumerable degrees in the difference hierarchy
Guohua Wu, Victoria University of Wellington, New Zealand
    Presentation slides: PDF...

12:00nn - 02:30pm

--- Lunch Break ---

02:30pm - 03:30pm

Computability-theoretic and proof-theoretic aspects of Vaughtian model theory
Denis Hirschfeldt, University of Chicago, USA
    Presentation slides: PDF...

03:30pm - 04:00pm

--- Coffee Break ---

04:00pm - 05:00pm

Positive-measure domination
Bjørn Kjos-Hanssen, University of Connecticut, USA
    Presentation slides: PDF...

« Back...

Week 1 · Week 2 · Week 3 · Week 4

 

Monday, 1 Aug 2005

09:30am - 10:30am

Generators and automorphism bases of the computably enumerable degrees
Klaus Ambos-Spies, Universität Heidelberg, Germany
    Presentation slides: PDF...

10:30am - 11:00am

--- Coffee Break ---

11:00am - 12:00nn

PA sets, 1-random sets, $\Pi^0_1$ classes
Antonin Kucera, Charles University, Czeck Republic
    Presentation slides: PDF...

12:00nn - 02:30pm

--- Lunch Break ---

02:30pm - 03:30pm

On the major sub-degree theorem (Part 1): The first strategy and the permitting rules
Angsheng Li, Chinese Academy of Sciences, China
    Presentation slides: PDF

03:30pm - 04:00pm

--- Coffee Break ---

04:00pm - 05:00pm

Open Forum: Future on Recursion Theory

Tuesday, 2 Aug 2005

09:30am - 10:30am

Definable ideals and quotient structures in R
Yue Yang, National University of Singapore, Singapore
    Presentation slides: PDF...

10:30am - 11:00am

--- Coffee Break ---

11:00am - 12:00nn

A tt version of the Posner-Robinson Theorem
W. Hugh Woodin, University of California, Berkeley, USA

12:00nn - 02:30pm

--- Lunch Break ---

02:30pm - 03:30pm

On the major sub-degree theorem (Part 2): The second strategy and the general methods
Angsheng Li, Chinese Academy of Sciences, China
    Presentation slides: PDF

03:30pm - 04:00pm

--- Coffee Break ---

04:00pm - 05:00pm

Locally countable partial orderings
Liang Yu, National University of Singapore, Singapore
    Presentation slides: PDF...

Wednesday, 3 Aug 2005

 

No talks scheduled...

Thursday, 4 Aug 2005

09:30am - 10:30am

Generalized tabular reducibilities in infinite levels of the Ershov difference hierarchy
Marat Arslanov Kazan State University, Russia
    Presentation slides: PDF...

10:30am - 11:00am

--- Coffee Break ---

11:00am - 12:00nn

Weak degrees of Pi^0_1 subsets of 2^omega
Steve Simpson, Pennsylvania State University, USA
    Presentation slides: PDF...

12:00nn - 02:30pm

--- Lunch Break ---

02:30pm - 03:30pm

Weak axioms of determinacy and subsystems of second order arithmetic
Kazuyuki Tanaka, Tohoku University Japan

03:30pm - 04:00pm

--- Coffee Break ---

04:00pm - 05:00pm

Refuting Downey's conjecture
Steffen Lempp, University of Wisconsin, Madison, USA
    Paper: PDF...

Friday, 5 Aug 2005

09:30am - 10:30am

Seetapun's theorem and related conjectures on the strength of stable Ramsey's theorem for pairs
Carl Jockusch, University of Illinois, Urbana-Champaign, USA

10:30am - 11:00am

--- Coffee Break ---

11:00am - 12:00nn

Measures and randomness
Jan Reimann, University of Heidelberg, Germany
    Presentation slides: PDF...

12:00nn - 02:30pm

--- Lunch Break ---

02:30pm - 03:30pm

On the problems of definability in the enumeration degrees
Iskander Kalimullin Kazan State University, Russia

03:30pm - 04:00pm

--- Coffee Break ---

04:00pm - 05:00pm

 

« Back...

Week 1 · Week 2 · Week 3 · Week 4

 

Monday, 8 Aug 2005

09:30am - 10:30am

Weakly scattered theories
Gerald Sacks Harvard University, USA

10:30am - 11:00am

--- Coffee Break ---

11:00am - 12:00nn

Reverse mathematics and Pi^1_2 comprehension
Steve Simpson, Pennsylvania State University, USA
    Presentation slides: PDF...

12:00nn - 02:30pm

--- Lunch Break ---

02:30pm - 03:30pm

Constructive logic and Medevedev degrees
Sebastiaan Terwijn, Technical University of Vienna, Austria
    Presentation slides: PDF...

03:30pm - 04:00pm

--- Coffee Break ---

04:00pm - 05:00pm

Relative randomness via rk-reducibility, progress report
Alexander Raichev, University of Wisconsin-Madison, USA

Tuesday, 9 Aug 2005

 

PUBLIC HOLIDAY (National Day)

Wednesday, 10 Aug 2005

 

No talks scheduled...

Thursday, 11 Aug 2005

09:30am - 10:30am

Computable measure theory
Decheng Ding, Nanjing University, China
    Presentation slides: PDF...

10:30am - 11:00am

--- Coffee Break ---

11:00am - 12:00nn

Computational prospects of infinity
Noam Greenberg, University of Notre Dame, USA
    Presentation slides: PDF...

12:00nn - 02:30pm

--- Lunch Break ---

02:30pm - 03:30pm

Some remarks on Ramsey’s Theorem for pairs
Chitat Chong, National University of Singapore, Singapore

03:30pm - 04:00pm

--- Coffee Break ---

04:00pm - 05:00pm

Realizing $\Sigma_1$ formulas in $\mathcal{R}$
Wei Wang, Nanjing University, China
    Presentation slides: PDF...

Friday, 12 Aug 2005

09:30am - 10:30am

The excess complexity of random reals
Joseph S. Miller, Victoria University/Indiana University, USA

10:30am - 11:00am

--- Coffee Break ---

11:00am - 12:00nn

Decidability and definability in the enumeration degrees
Thomas Franklin Kent, University of Wisconsin, Madison, USA
    Presentation slides: PDF...

12:00nn - 02:30pm

--- Lunch Break ---

02:30pm - 03:30pm

 

03:30pm - 04:00pm

--- Coffee Break ---

04:00pm - 05:00pm

 

« Back...

Week 1 · Week 2 · Week 3 · Week 4

 

Organizing Committee · Confirmed Visitors · Overview · Activities · Membership Application