The full version of this announcement is available.
Topics: frontiers between a decidable halting problem and an undecidable one: Turing machines, register machines, cellular automata, tiling of the plane, polyominoes, snakes, neural networks, other machines; minimal universal codes: size of such a code, namely, for Turing machines, register machines, cellular automata, tilings,... computation complexity of machines with a decidable halting problem as well as universal machines; self-reproduction and other tasks.
Program Committee Michel Cosnard, ENS Lyon; Joaquim Gabarro, U. Barcelona; Eric Goles, U. Chile, Santiago; Maurice Margenstern, U. Paris 11, LITP, IBP, Chair; Maurice Nivat, U. Paris 7, LITP, IBP.
Organizing Committee Maurice Margenstern, U. Paris 11, LITP, Chair; Jean-Baptiste Yunes, U. Paris 7, LITP.
Grants For Students: Fifteen grants are wished for allowing PhD or Postdoc students to attend the workshop. Presently, six grants can be actually given. The eventual number of grants which will actually be given will be announced, not later than March, 1st. Students or young reseachers wishing to apply for this grants must ask by e-mail a form to be received by fax and to be returned to the organizing committee mandatory by fax before February, 15 (no delay). They will be answered not later than March, 1st. Grants amount to at most 1450FF for applicants living in France and at most 1700FF for those living outside of France.
Registration: For attending the workshop, send your registration to our secretary or send it using the form in the full version of this announcement. You may use surface mail, fax or email. Registration fees amount to 300FF, but 150FF for participants whose institution has made grant to the workshop and 200FF for people granted by the organizing committee. In all cases, fees must be paid to the workshop organization before March 1st, 1995.