Turing complexity of the ordinals (Q580332)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Turing complexity of the ordinals |
scientific article |
Statements
Turing complexity of the ordinals (English)
0 references
1986
0 references
Countable ordinals are identified with mappings from \(N\times N\) to \(\{\) 0,1\(\}\). A countable ordinal belongs to the complexity class \({\mathcal C}\) if there exists an underlying mapping in \({\mathcal C}\). Under this definition it is shown that every recursive ordinal is in DTIME(n).
0 references
Turing machines
0 references
Countable ordinals
0 references
recursive ordinal
0 references
