


default search action
2. MCU 1998: Metz, France
- Maurice Margenstern:

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 - Yuri V. Matiyasevich:

Universal Polynomials. MCU (1) 1998: 1-20 - Géraud Sénizergues:

Complete Formal Systems for Equivalence Problems. MCU (1) 1998: 22-49 - Lila Kari, Greg Gloor, Sheng Yu:

Using DNA to solve the Bounded Post Correspondence Problem. MCU (1) 1998: 51-65 - Gheorghe Paun:

DNA Computing Based on Splicing: Universality Results. MCU (1) 1998: 67-91 - David Harel:

Towards a Theory of Recursive Structures. MCU (1) 1998: 93-114 - Christian Michaux, Christophe Troestler:

Isomorphism Theorem for BSS Recursiveley Enumerable Sets over Real Closed Fields. MCU (1) 1998: 116-139 - Maurice Margenstern:

Frontier between decidability and undecidability: a survey. MCU (1) 1998: 141-177 - Hava T. Siegelmann, Asa Ben-Hur, Shmuel Fishman:

A Theory of Complexity for Continuous Time Dynamics. MCU (1) 1998: 179-203 - Liudmila Pavlotskaya:

On the notion of algorithmic decidability. MCU (1) 1998: 205-209 - Hiroshi Umeo:

A deisgn of cellular algorithms for 1-bit inter-call communications and related cellular algorithms. MCU (1) 1998: 211-227 - Joaquim Gabarró, Xavier Messeguer:

Relaxed Tree Structures, a Way to Deal with Concurrency and Parallelism on Dictionaries. MCU (1) 1998: 229-269

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














