| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 132 0 |
 SM ISO690:2012ROGOZHIN, Yurii. Small universal Turing machines. In: Theoretical Computer Science, 1996, vol. 168, pp. 215-240. ISSN 0304-3975. DOI: https://doi.org/10.1016/S0304-3975(96)00077-1 |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
  Theoretical Computer Science |
||||||
| Volumul 168 / 1996 / ISSN 0304-3975 /ISSNe 1879-2294 | ||||||
|
||||||
| DOI:https://doi.org/10.1016/S0304-3975(96)00077-1 | ||||||
| Pag. 215-240 | ||||||
|
||||||
| Rezumat | ||||||
Let UTM(m, n) be the class of universal Turing machine with m states and n symbols. Universal Turing machines are proved to exist in the following classes: UTM(24,2), UTM(10,3), UTM(7,4), UTM(5,5), UTM(4,6), UTM(3,10) and UTM(2,18). |
||||||
| Cuvinte-cheie Engineering controlled terms Equivalence classes, Theorem proving Engineering uncontrolled terms Universal Turing machines (UTM) Engineering main heading Turing machines |
||||||
|
|
|
|
