![universität [bonn]](img/uni-logo_gelb50.png){kind=logo}
 |
|
|
|
 |
|
|
|
|
|
|
|
|
|
|
 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
BIWOC - Bonn International Workshop on Ordinal Computability |
||
|
|
|
| Bonn, January 21-25, 2007 | ||
|
The informal slots in the afternoons are used for informal presentations and discussions, to be decided on a day to day basis at the workshop. Sunday, January 21, 200710:00-10:10 Peter Koepke: Welcome, Opening Remarks10:10-11:10 Joel Hamkins: A Survey of Infinite Time Turing Machines 11:30-12:30 Peter Koepke: Ordinalize! 13:00-15:00 Buffet lunch at China City, Clemens-August-Strasse 2 16:00-16:30 Afternoon coffee and tea 16:30-17:30 Informal slot: Philip Welch Monday, January 22, 200709:30-10:45 Sy Friedman: Recursion Theory on an Admissible Ordinal11:15-12:30 Philip Welch: Descriptive set theoretic aspects of ordinal computability 16:00-16:30 Afternoon coffee and tea 16:30-17:30 Informal slot: Michael Rathjen Tuesday, January 23, 200709:30-10:30 Ralf Schindler: The P vs. NP problem for infinite time Turing machines11:00-11:30 Ryan Siders: Ordinal register machines 12:00-12:30 David Linetsky: The complexity of quickly decidable ORM sets 12:35 Workshop photograph 16:00-16:30 Afternoon coffee and tea 16:30-17:30 Informal slot: Open discussion Wednesday, January 24, 200709:30-10:30 Wolfram Pohlers: tba10:45-11:30 Steve Warner: Infinite time computable model theory I 11:45-12:30 Daniel Seabold: Infinite time computable model theory II 15:30-16:00 Afternoon coffee and tea 16:00-17:30 Informal slot: Joost Winter, Problem session 17:45-18:30 Informal walking tour of Bonn 18:30-??:?? Conference dinner at DACAPO, Beethovenhalle Thursday, January 25, 200709:30-10:00 Barnaby Dawson: Extensions of ordinal time computers10:30-11:00 Sam Coskey: Infinite time computable equivalence relation theory 11:30-12:30 Russell Miller: Post's problem for Ordinal Register Machines 15:30-16:00 Afternoon coffee and tea |
||