The laterality problem for non-erasing Turing machines on $\lbrace 0,1\rbrace $ is completely solved (Q4349780): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4284259 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4850436 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4850464 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5590814 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solvability of the halting problem for certain classes of Turing machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3862404 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3661558 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Small universal Turing machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Computable Numbers, with an Application to the Entscheidungsproblem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5557935 / rank | |||
Normal rank | |||
Latest revision as of 17:20, 27 May 2024
scientific article; zbMATH DE number 1051686
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
