The computational strengths of \(\alpha\)-tape infinite time Turing machines (Q2453073): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.apal.2014.04.016 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.APAL.2014.04.016 / rank | |||
Normal rank | |||
Latest revision as of 17:48, 18 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The computational strengths of \(\alpha\)-tape infinite time Turing machines |
scientific article |
Statements
The computational strengths of \(\alpha\)-tape infinite time Turing machines (English)
0 references
6 June 2014
0 references
infinite-time Turing machine
0 references
ordinal computability
0 references
supertask
0 references
transfinite computation
0 references
