RO  EN
IMI/Publicaţii/CSJM/Ediţii/CSJM v.1, n.3 (3), 1993/

About Shannon's problem for turing machines

Authors: Rogojin Iurie

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:

Fulltext

Adobe PDF document0.10 Mb