The laterality problem for non-erasing Turing machines on $\lbrace 0,1\rbrace $ is completely solved (Q4349780)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1051686
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The laterality problem for non-erasing Turing machines on $\lbrace 0,1\rbrace $ is completely solved |
scientific article; zbMATH DE number 1051686 |
Statements
The laterality problem for non-erasing Turing machines on $\lbrace 0,1\rbrace $ is completely solved (English)
0 references
25 August 1997
0 references
Turing machine
0 references
decidability
0 references
0.8454572
0 references
0.8187289
0 references
0.8168677
0 references
0.81315976
0 references
0.8048769
0 references
0.80167115
0 references
0.80163556
0 references
0.79713994
0 references
