AAAAAA

   
Results: 1-7 |
Results: 7
THE LATERALITY PROBLEM FOR NON-ERASING TURING-MACHINES ON (0,1) IS COMPLETELY SOLVED
Authors: MARGENSTERN M
Citation: M. Margenstern, THE LATERALITY PROBLEM FOR NON-ERASING TURING-MACHINES ON (0,1) IS COMPLETELY SOLVED, Informatique theorique et applications, 31(2), 1997, pp. 159-204
UNIVERSALITY OF THE CHIP-FIRING GAME
Authors: GOLES E MARGENSTERN M
Citation: E. Goles et M. Margenstern, UNIVERSALITY OF THE CHIP-FIRING GAME, Theoretical computer science, 172(1-2), 1997, pp. 121-134
FOREWORD
Authors: MARGENSTERN M
Citation: M. Margenstern, FOREWORD, Theoretical computer science, 168(2), 1996, pp. 213-214
SAND PILE AS A UNIVERSAL COMPUTER
Authors: GOLES E MARGENSTERN M
Citation: E. Goles et M. Margenstern, SAND PILE AS A UNIVERSAL COMPUTER, International journal of modern physics C, 7(2), 1996, pp. 113-122
2 UNIVERSAL TURING-MACHINES WITH AT MOST 2 LEFT INSTRUCTIONS
Authors: MARGENSTERN M PAVLOTSKAIA L
Citation: M. Margenstern et L. Pavlotskaia, 2 UNIVERSAL TURING-MACHINES WITH AT MOST 2 LEFT INSTRUCTIONS, Comptes rendus de l'Academie des sciences. Serie 1, Mathematique, 320(11), 1995, pp. 1395-1400
A NON-ERASING UNIVERSAL TURING MACHINE WI TH PRECISELY 3 LEFT INSTRUCTIONS
Authors: MARGENSTERN M
Citation: M. Margenstern, A NON-ERASING UNIVERSAL TURING MACHINE WI TH PRECISELY 3 LEFT INSTRUCTIONS, Comptes rendus de l'Academie des sciences. Serie 1, Mathematique, 320(1), 1995, pp. 101-106
NONERASING TURING-MACHINES - A FRONTIER BETWEEN A DECIDABLE HALTING PROBLEM AND UNIVERSALITY
Authors: MARGENSTERN M
Citation: M. Margenstern, NONERASING TURING-MACHINES - A FRONTIER BETWEEN A DECIDABLE HALTING PROBLEM AND UNIVERSALITY, Theoretical computer science, 129(2), 1994, pp. 419-424
Risultati: 1-7 |