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 |