RO EN
About Shannon's problem for turing machines
Authors: Rogojin Iurie
– 0.10 Mb
Abstract
Describe the universal turing machine with 3 states and 10 symbols and with 27 commands really used in the program.Yu. Rogozhin
Institute of Mathematics,
Academy of Sciences of Moldova,
5 Academiei str.,
Kishinev, 277028, Moldova
Phone: (3732) 73-80-21,
E-mail:
Institute of Mathematics,
Academy of Sciences of Moldova,
5 Academiei str.,
Kishinev, 277028, Moldova
Phone: (3732) 73-80-21,
E-mail:
Fulltext
– 0.10 Mb
Contents
- Distributed operating systems for multiprocessors and networks
- Applied program system for the prognosis of the biological activity of chemical compounds: development and use
- Automatized systems for knowledge acquisition
- On the invariance of the Pareto optimal set
- On link diameter of a simple rectilinear polygon
- A note on two constrained parametric problems on networks
- An Invitation to GAP
- The model of the stochastic generator of the test programs and a method of its analyse
- About Shannon's problem for turing machines
