2. MCU 1998: Metz, France

Maurice Margenstern (Ed.): International Colloquium Universal Machines and Computations, MCU'98, Metz, France, March 23-27, 1998, Proceedings, Volume I. IUT Metz 1998, ISBN 2-9511539-2-9 BibTeX

Yuri Matiyasevich: Universal Polynomials. 1-20 BibTeX
Géraud Sénizergues: Complete Formal Systems for Equivalence Problems. 22-49 BibTeX
Lila Kari, Greg Gloor, Sheng Yu: Using DNA to solve the Bounded Post Correspondence Problem. 51-65 BibTeX
Gheorghe Paun: DNA Computing Based on Splicing: Universality Results. 67-91 BibTeX
David Harel: Towards a Theory of Recursive Structures. 93-114 BibTeX
Christian Michaux, Christophe Troestler: Isomorphism Theorem for BSS Recursiveley Enumerable Sets over Real Closed Fields. 116-139 BibTeX
Maurice Margenstern: Frontier between decidability and undecidability: a survey. 141-177 BibTeX
Hava T. Siegelmann, Asa Ben-Hur, Shmuel Fishman: A Theory of Complexity for Continuous Time Dynamics. 179-203 BibTeX
Liudmila Pavlotskaya: On the notion of algorithmic decidability. 205-209 BibTeX
Hiroshi Umeo: A deisgn of cellular algorithms for 1-bit inter-call communications and related cellular algorithms. 211-227 BibTeX
Joaquim Gabarró, Xavier Messeguer: Relaxed Tree Structures, a Way to Deal with Concurrency and Parallelism on Dictionaries. 229-269 BibTeX