About Shannon's problem for turing machines
Describe the universal turing machine with 3 states and 10 symbols and with 27 commands really used in the program.
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
1993-12-01
|
| Series: | Computer Science Journal of Moldova |
| Online Access: | http://www.math.md/nrofdownloads.php?file=/files/csjm/v1-n3/v1-n3-(pp108-111).pdf |
| id |
doaj-f8319549d9b2451e95889bc655b0b31e |
|---|---|
| record_format |
Article |
| spelling |
doaj-f8319549d9b2451e95889bc655b0b31e2020-11-24T23:00:01ZengInstitute of Mathematics and Computer Science of the Academy of Sciences of MoldovaComputer Science Journal of Moldova1561-40421993-12-0113(3)108111About Shannon's problem for turing machinesYu. Rogozhin0Institute of Mathematics, Academy of Sciences of Moldova, 5 Academiei str., Kishinev, 277028, MoldovaDescribe the universal turing machine with 3 states and 10 symbols and with 27 commands really used in the program.http://www.math.md/nrofdownloads.php?file=/files/csjm/v1-n3/v1-n3-(pp108-111).pdf |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Yu. Rogozhin |
| spellingShingle |
Yu. Rogozhin About Shannon's problem for turing machines Computer Science Journal of Moldova |
| author_facet |
Yu. Rogozhin |
| author_sort |
Yu. Rogozhin |
| title |
About Shannon's problem for turing machines |
| title_short |
About Shannon's problem for turing machines |
| title_full |
About Shannon's problem for turing machines |
| title_fullStr |
About Shannon's problem for turing machines |
| title_full_unstemmed |
About Shannon's problem for turing machines |
| title_sort |
about shannon's problem for turing machines |
| publisher |
Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova |
| series |
Computer Science Journal of Moldova |
| issn |
1561-4042 |
| publishDate |
1993-12-01 |
| description |
Describe the universal turing machine with 3 states and 10 symbols and with 27 commands really used in the program. |
| url |
http://www.math.md/nrofdownloads.php?file=/files/csjm/v1-n3/v1-n3-(pp108-111).pdf |
| work_keys_str_mv |
AT yurogozhin aboutshannonsproblemforturingmachines |
| _version_ |
1725642954184327168 |