page en construction

---

---

1. E. Goles, M. Margesntern
   Sand pile as universal computer, International Journal of Modern Physics C., 7, N2, 113-122, (1996).
2. E. Goles, M. Margenstern
   Universality of the chip-firing game, Theoretical Computer Science, 172, 1-2, 91-120, (1997). site de TCS
3. M. Margenstern
   The laterality problem for non-erasing Turing machines on {0,1} is completely solved, Theoretical Informatics and Applications, 31, N2, 159-204, (1997).
4. M. Margenstern
   Frontier between decidability and undecidability a survey, Theoretical Computer Science, 231-2, 217-251, (2000). site de TCS
5. M. Margenstern
   New Tools for Cellular Automata of the Hyperbolic Plane, Journal of Universal Computer Science, 6, N12, 1226-1252, (2000). fichier ps/pdf
6. M. Margenstern
   On almost unilateral universal Turing machines, Theoretical Computer Science, 257, 1-2, 153-166, (2001). site de TCS
7. M. Margenstern, Yu. Matiyasevich
   A binomal representation of 3x+1, Acta Arithmetica, 91.4, 367-378, (1999). fichier pdf
8. M. Margenstern, K. Morita
   NP problems are tractable in the space of cellular automata in the hyperbolic plane, Theoretical Computer Science, 259, 99-128, (2001). site de TCS
9. M. Margenstern, L. Pavlotskaya
   On the optimal number of instructions for universal Turing machines connected with a finite automaton, International Journal of Algebra and Computation, (2002), à paraître.
10. M. Margenstern, Yu. Rogozhin
    A universal time-varying distributed H system of degree 2, Biosystems, 52, 73-80, (1999).
11. K. Morita, M. Margenstern, K. Imai,
    Universality of reversible hexagonal cellular automata, Theoretical Informatics and Applications, 33, 535-550, (1999). fichier pdf
12. H. Siegelmann, M. Margenstern
    Nine Swith-Affine Neurons Suffice for Turing Universality, Neural Network, 12, 593-600, (1999).
    
    
13. M. Margenstern, Yu. Rogozhin
    Time-varying distrubute $H$-systems of degree $2$ generate all receusively enumerable languages, C. Martin-Vide, V. Mitrana (eds.), Where Mathematics, Computer Science, Linguistics and Biology Meet, Kluwer Academic Press Publishers , 399-407, (2001).
    
    
14. M. Margenstern
    Non-erasing Turing machines : a new frontier between a decidable halting problem and universality, Lecture Notes in Computer Science, 911, 386-397, (1995), Proceedings of LATIN'95, Valpara\'\i so, April 1995.
15. M. Margenstern
    Decidability and Undecidability of the Halting Problem on Turing Machines, a Survey, Lecture Notes in Computer Science, 1234, 226-236, (1997), Proceedings of LFCS'97, Yaroslavl, August 1997.
16. M. Margenstern, Yu. Rogozhin
    About Time-Varying Distributed $H$-systems, Lecture Notes in Computer Science, 2054, 53-62, (2000), Proceedings of DNA'6. Leiden, June, 2000.

retour