TAI2000

Forth French Days on

Algorithmic Theory of Information

Machine Learning and Inductive Inference

*****

Thursday June 8th- Friday June 9th 2000

Villeneuve d'Ascq

France

Invited speakers : Paul Vitányi (CWI), Peter Gacs (Boston University) , Alexander Shen (Independent University of Moscow)


French version

Some pictures of TAI'99

NEW : leaflet with programme (Postscript version)

Colloquium Presentation

Algorithmic Information Theory is one of the most important theoretical contribution to computer science. It strongly defines the concept of information content. Jointly discovered during the sixties by A.N. Kolmogorov, R. Solomonoff and C. J. Chaitin, it became widely known in the computer science research communauty only at the beginning of the nineties, thanks to the remarquable work of M. Li and P. Vitányi.
In 1997, a few French theoretical computer science researchers decided to create a national conference on this topic, in order to strenght the links and make knowledge and questions moving inside the communauty of interested people.
The first colloquium took place in Lille on june, 23th-24th 1997. It gathered around 20 people. V. Uspenski, professor at the University of Moscow, and former Kolmogorov's student, was there as inveitesd guest.
The second colloquium held in Lyon, on september 10th-11th 1998, with S. Shen as invited guest.
The third edition took place in Nancy, on may 20th-21st 1999. Around 40 people participated, among them a lot of famous guests.

The forth meeting is coming back to Lille, and will take place on june 8th-9th 2000. This edition will particularly focus on one topic : application of Algorithmic Information Theory to Machine Learning and Inductive Inference. The special guests are Professors Paul Vitányi and Peter Gacs. Paul Vitányi widely helped in spreading the Algorithmic Information Theory through the scientific communauty. He is the author of many papers about the links between Algorithmic Information Theory and Inductive Inference. Peter Gacs produced many important works on Algorithmic Information Theory.

Place

The meeting will take place in the "Maison de la recherche" at the University of Lille 3 in Villeneuve d'Ascq not far from Lille.

Practical links

Organisation

It is organized by the GRAPPA team (Machine learning Group) of the University of Lille 3, together with the University of Lille1 (L.I.F.L. associated team).

Back to top

Organising Committee

François Denis (responsible),
Francesco Decomité,
Aurélien Lemay,
Rémi Gilleron,
Isabelle Tellier,
Marc Tommasi
Contacts :
 
François Denis
U.F.R. de Mathématiques, Sciences Economiques et Sociales
B.P. 149
59 653 VILLENEUVE D'ASCQ CEDEX
Tel. (33) 03-20-41-61-75
Fax (33) 03-20-41-61-71
E-mail : denis@univ-lille3.fr
Francesco De Comité
L.I.F.L.
Université des Sciences et Technologies de Lille
59 655 VILLENEUVE D'ASCQ CEDEX
Tel. (33) 03-20-43-42-63
Fax (33) 03-20-43-65-66
E-mail : decomite@lifl.fr

Back to top

Registration


Name
Email
Time of arrival
Time of departure
I wish to submit a paper
Remarks :


 
 

Registration is free, meals will be served at the University canteen.

As the number of participants is limited, it is strongly recommended to register early, by fax, email, or, best of all, by filling the above form (please tell us in case of problem for sending it).

We let you choose your hotel, using the maps and links given above in this page. (The cheapest hotel in Lille is called Misterbed, in the center of the city. Rooms cost 230FF per night. Phone number : 03 20 12 96 96 Fax 03 20 40 25 87)

Program Committee

Max Dauchet (professeur, LIFL, université de Lille 1)
François Denis (maître de conférences, Grappa - LIFL, université de Lille 1 et Lille 3)
Jean-Paul Delahaye (professeur, université de Lille 1)
Bruno Durand (professeur, université de Marseille)
Serge Grigorieff (professeur, université de Paris 7)
Jean-Yves Marion (maître de conférences, LORIA, université de Nancy 2)

Back to top

Program

Invited Speakers : Paul Vitányi (CWI), Peter Gacs (Boston University) , Alexander Shen (Independent University of Moscow)

Jeudi 8 Juin / Thursday June 8th

9h30 - 9h50 Accueil / Welcome
9h50 - 10h Ouverture / Opening
10h - 11hPaul Vitányi (CWI) Three Approaches to the Quantitative Definition of Information in an Individual Pure Quantum State
11h - 11h30 Pause / Break
11h30 - 12hJohn Tromp (CWI) Algorithmics StatisticsRésumé / Abstract
12h - 12h45Sophie Laplante (LRI Université Paris Sud) Quantum Kolmogorov Complexity. Résumé / Abstract
12h45 - 14h30 Repas / Meal
14h30 - 15h30Peter Gacs (Boston University) Quantum Algorithmic TheoryRésumé / Abstract
15h30 - 16hJean-Yves Marion (LORIA Nancy)
Serge Grigorieff (Paris 7)
Kolmogorov Complexity and non-determinism Résumé / Abstract
16h - 16h30 Pause / Break
16h30 - 17hJorge Castro Rabal
(Universitat Politècnica de Catalunya)
Query learning models as a design tool for PAC models. Résumé / Abstract
17h - 17h30Julien Cervelle, Enrico Formenti et Bruno Durand Algorithmic Information Theory and Cellular Automata Dynamics. Résumé / Abstract
20h Repas / Meal (Restaurant Le Champlain)

Vendredi 9 Juin / Friday June 9th

9h - 10hAlexander Shen
(Independant University of Moscow)
Kolmogorov Complexity, recent results in Moscow
10h - 10h30Yuri Kalnishkan
Volodya Vovk
(Royal Holloway College, London)
The Existence of Predictive Complexity and the Legendre Transformation. Résumé / Abstract
10h30 - 11h Pause / Break
11h - 12hMarten Trautwein (Perot Systems Nederland BV)
Marco Vervoort(University of Amsterdam)
The Emile Approach to Grammar Induction put into Practice Résumé / Abstract
1h - 12h30 Jacques Alès Bianchetti (LRI Université Paris Sud)An Application of Kolmogorv Complexity to Analogical Reasoning Résumé / Abstract
12h30 - 14h30 Repas / Meal
14h30 - 15h30 Bilan et organisation TAI 2001

Back to top

The Algorithmic Theory of Information : Links and references

Sponsors

Back to top


Francesco.Decomite

Complain about my english
compteur : Web-counter
Last modified: Wed May 31 10:15:55 CEST 2000