The computational strengths of \(\alpha\)-tape infinite time Turing machines (Q2453073): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:44, 2 February 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
