3-5 November 2007
Cape Town, South Africa
_______________________________________________________________
First Call for Participation
International Conference on Infinity in Logic & Computation
3-5 November 2007, University of Cape Town, South Africa
http://www.mth.uct.ac.za/FACS-Lab/ILC07/
Early registration deadline: *15 October 2007*
________________________________________________________________
TOPICS
o Automata on infinite objects
o Combinatorics, cryptography and complexity
o Computability and complexity on the real numbers
o Infinite games and their connections to logic
o Logic, computability, and complexity
in finitely presentable infinite structures
o Randomness and computability
o Transfinite computation
o Verification of infinite state systems
INVITED SPEAKERS
o Willem L. Fouche (Pretoria, South Africa)
o Erich Graedel (Aachen, Germany)
o Thomas A. Henzinger (Lausanne, Switzerland)
o Joel David Hamkins (New York NY, United States of America)
o Peter Hertling (Munich, Germany)
o Joseph S. Miller (Storrs CT, United States of America)
o Helmut Prodinger (Stellenbosch, South Africa)
CONFERENCE SCHEDULE
Friday 2 November
18:00-20:00 Registration (All Africa House)
Saturday 3 November
08:00 Registration (Conference Venue)
09:20 Opening
09:30 Thomas A. Henzinger (Invited Speaker)
Three Sources of Infinity in Computation: Nontermination,
Real Time, and Probabilistic Choice
10:30 Coffee Break
11:00 Michael Ummels
The Complexity of Finding Nash Equilibria in Infinite
Multiplayer Games
11:20 Jacques Duparc and Alessandro Facchini
Complexity of Delta^1_2 Sets and mu-Calculus: when Infinite
Games make Modal Logic and Descriptive Set Theory Meet
11:40 Douadi Mihoubi
On the Sets of Infinite Words Recognized by Deterministic
one Turn Pushdown Automata
12:00 Valentin Goranko and Wilmari Bekker
Infinite-State Verification of the Basic Tense Logic on
Rational Kripke Models
12:20 Govert van Drimmelen
Tableaux and Automata for Parikh's Game Logic
12:40 Lunch Break
14:30 Joel David Hamkins (Invited Speaker)
New Developments in Infinite Time Turing Machines
15:30 Coffee Break
15:50 Joost Winter
Space Complexity for Infinite Time Turing Machines
16:10 Barnaby Dawson
Generalising Ordinal Time Turing Computation
16:30 Mark Hogarth
Non-Turing Computers are the New Non-Euclidean Geometries
16:50 Feng Liu, Zhoujun Li and Ti Zhou
Boundary on Agent Number Needed in Security Protocol Analysis
Based on Horn Logic
17:10 End of the Day
Sunday 4 November
09:30 Peter Hertling (Invited Speaker)
- title to be announced -
10:30 Coffee Break
11:00 Timothy McNicholl
Computational Issues in the Theory of Bounded
Analytic Functions
11:20 Klaus Weihrauch
Computable Elementary Topology
11:40 Vasco Brattka and Mashudu Makananise
Limit Computable Functions and Subsets on
Metric Spaces
12:00 Eyvind Martol Briseid
Effective Rates of Convergence for Picard Iteration
Sequences
12:20 Philipp Gerhardy
Proof mining in Ergodic Theory and Topological Dynamics
12:40 Lunch Break
14:30 Willem L. Fouche (Invited Speaker)
Ramsey Theory and the Symmetries of Countably
Categorical Structure
15:30 Coffee Break
15:50 Joseph S. Miller (Invited Speaker)
- title to be announced -
16:50 Excursion
19:00 Conference Dinner
21:00 End of the Day
Monday 5 November
09:30 Helmut Prodinger (Invited Speaker)
Infinity in Combinatorics: Asymptotic Enumeration
10:30 Coffee Break
11:00 Margaret Archibald and Arnold Knopfmacher
The Average Position of the First Maximum in a Sample of
Geometric Random Variables
11:20 George Davie
Complexity Withholding Strings
11:40 Petrus H. Potgieter and Elemer E. Rosinger
Three Perspectives on Right-Sizing the Infinite
12:00 Willem L. Fouche
Fractal Geometry of an Algorithmically Random
Brownian Motion
12:20 Lunch Break
14:30 Yoshiki Tsujii, Takakazu Mori, Mariko Yasugi and Hideki Tsuiki
Fractals Defined by Infinite Contractions and
Mutual-Recursive Sets
14:50 Hideki Tsuiki and Shuji Yamada
On Finite-time Computable Functions
15:10 Boris Melnikov and Elena Melnikova
Some More on the Billiard Languages and Corresponding Forbidden
Languages
15:30 Alain Finkel, Etienne Lozes and Arnaud Sangnier
Towards Model-Checking Pointer Systems
15:50 Ti Zhou, Zhoujun Li, Mengjun Li and Huowang Chen
Modeling and Verifying Time Sensitive Security Protocols with
Constraints
16:10 Coffee Break
16:30 Erich Graedel (Invited Speaker)
Banach-Mazur Games on Graphs
17:30 Closing
This schedule might be subject to changes!
PROGRAMME COMMITTEE
o Ahmed Bouajjani (Paris, France)
o Vasco Brattka (Cape Town, South Africa)
o Valentin Goranko (Johannesburg, South Africa)
o Ker-I Ko (Stony Brook NY, United States of America)
o Orna Kupferman (Jerusalem, Israel)
o Benedikt Loewe (Amsterdam, The Netherlands) -Chair-
o Elvira Mayordomo (Zaragoza, Spain)
o Dieter Spreen (Siegen, Germany)
o Wolfgang Thomas (Aachen, Germany)
o Yde Venema (Amsterdam, The Netherlands)
o Klaus Weihrauch (Hagen, Germany)
o Philip Welch (Bristol, United Kingdom)
o Mariko Yasugi (Kyoto, Japan)
o Jeffery Zucker (Hamilton, Canada)
OBJECTIVE
The conference on Infinity in Logic & Computation is the first
conference in South Africa that focuses on infinity in automata
theory, logic, computability and verification. One purpose of
this conference is to catalyse new interactions among local and
international researchers and to expose postgraduate students to
recent research trends in these fields.
The conference will be organised at the University of Cape Town
co-located with the 50th Annual Congress of the South African
Mathematical Society (SAMS) that takes place from 31 October
until 2 November 2007.
We plan to organise a summer school on Logic & Computation
directly following the conference from 6-9 November 2007.
This summer school is intended for postgraduate students and
other interested participants.
ORGANISERS
o Margaret Archibald (Cape Town, South Africa)
o Vasco Brattka (Cape Town, South Africa)
o Valentin Goranko (Johannesburg, South Africa)
o Hans-Peter Kuenzi (Cape Town, South Africa)
o Benedikt Loewe (Amsterdam, The Netherlands)
PROCEEDINGS
We plan to publish fully refereed post-conference proceedings
in the book series of the Association of Logic, Language and
Information (FoLLI) that is a sub series of the Lecture Notes
in Artificial Intelligence (LNAI) of Springer.
WEB PAGE AND CONTACT
http://www.mth.uct.ac.za/FACS-Lab/ILC07/
________________________________________________________________