ON THE OPTIMAL NUMBER OF INSTRUCTIONS FOR UNIVERSAL TURING MACHINES CONNECTED WITH A FINITE AUTOMATON (Q3043622): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Frontier between decidability and undecidability: A survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5590814 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On machines, universal by extensions / rank | |||
Normal rank | |||
Latest revision as of 18:32, 6 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | ON THE OPTIMAL NUMBER OF INSTRUCTIONS FOR UNIVERSAL TURING MACHINES CONNECTED WITH A FINITE AUTOMATON |
scientific article |
Statements
ON THE OPTIMAL NUMBER OF INSTRUCTIONS FOR UNIVERSAL TURING MACHINES CONNECTED WITH A FINITE AUTOMATON (English)
0 references
6 August 2004
0 references
Turing machines
0 references
universality
0 references
decidability
0 references
finite automata
0 references
