RO EN
Some small self-describing Turing machines
Authors: M. Margenstern, Rogojin Iurie
– 0.18 Mb
Abstract
Several small self-describing Turing machines are constructed. The number of instructions varies from 275 to 206, depending on the chosen encoding principles. The previous Thatcher's result (2532 instructions of self-describing machine in Wang's format) is essentially improved.Maurice Margenstern, Yurii Rogozhin,
Prof. Maurice Margenstern
Universitи de Metz, I.U.T. de Metz,
Dиpartement d'Informatique,
Оle du Saulcy, 57045 Metz Cedex, FRANCE
e-mail:
Dr. Yurii Rogozhin
Institute of mathematics,
Academy of Sciences of Moldova,
5 Academiei str., Kishinev,
MD-2028, Moldova
email:
Prof. Maurice Margenstern
Universitи de Metz, I.U.T. de Metz,
Dиpartement d'Informatique,
Оle du Saulcy, 57045 Metz Cedex, FRANCE
e-mail:
Dr. Yurii Rogozhin
Institute of mathematics,
Academy of Sciences of Moldova,
5 Academiei str., Kishinev,
MD-2028, Moldova
email:
Fulltext
– 0.18 Mb
Contents
- Syntesis of group project decisions in distributed computer decision support systems
- Algorithms for finding the minimum cycle mean in the weighted directed graph
- Stability, pseudostability and quasistability of vector trajectorial lexicographic optimization problem
- Some small self-describing Turing machines
- Direct methods for solving singular integral equations with complex conjugation
- Direct methods for solving singular integral equations with shifts in the unit circle
