2. MCU 1998:
Metz,
France
Maurice Margenstern (Ed.):
International Colloquium Universal Machines and Computations, MCU'98, Metz, France, March 23-27, 1998, Proceedingsi, Volume II.
IUT Metz 1998, ISBN 2-9511539-1-0 BibTeX
- Mika Hirvensalo:
Copying quantum computer makes NP-complete problems tractable.
1-10 BibTeX
- Claudio Ferretti, Giancarlo Mauri, Satoshi Kobayashi, Takashi Yokomori:
On the Universality of Post and Splicing Systems.
12-28 BibTeX
- Claudio Ferretti, Giancarlo Mauri, Claudio Zandron:
Nine Test Tubes Generate any RE Language.
30-41 BibTeX
- Henning Fernau, Rudolf Freund, Markus Holzer:
The Generative Power of d-Dimensional #-Context-Free Array Grammars.
43-56 BibTeX
- Hiroshi Sakamoto, Daisuke Ikeda:
Intractability of Decision Problems for Finite-Memory Automata.
58-74 BibTeX
- Arnaud Maes:
More on Morphisms and Almost-Periodicity.
76-88 BibTeX
- Katsunobu Imai, Kenichi Morita:
A computation-universal two-dimensional 8-state triangular reversible cellular automaton.
90-99 BibTeX
- Ivan Korec:
Real-time generation of primes by a one-dimensional cellular automaton with 9-states.
101-116 BibTeX
- Jérôme Olivier Durand-Lose:
About the Universality of the Billiard ball model.
118-132 BibTeX
- Paolo Boldi, Sebastiano Vigna:
The Turing Closure of an Archimedean Field.
134-150 BibTeX
- Jean Sylvestre Gakwaya:
The Separation Theorem for the Relation Classes Associated to the Extended Grzegorczyk Classes.
152-167 BibTeX
- Ulrich Nitsche:
On the Border of Universality and Non-Universality in Restricted High-Level Petri Nets.
169-181 BibTeX
- Jacqueline Signorini, Patrick Greussay:
Foldede and Immersed Cellular Automata.
183-192 BibTeX
- Andrew Adamatzky:
Dynamical universal computation in excitable lattices.
194-213 BibTeX
- Vasco Brattka, Klaus Weihrauch:
Recursive and Recursively Enumerable Closed Subsets of Euclidean Space.
215-234 BibTeX
Copyright © Sat May 16 23:29:22 2009
by Michael Ley (ley@uni-trier.de)
