Turing complexity of the ordinals (Q580332)
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 4016883
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Turing complexity of the ordinals |
scientific article; zbMATH DE number 4016883 |
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
0.7820215225219727
0 references
0.7448285818099976
0 references
0.7405683398246765
0 references
0.7400501370429993
0 references
0.7348519563674927
0 references
