Every recursive linear ordering has a copy in DTIME-SPACE(<i>n</i>,log(<i>n</i>)) (Q3489983): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Turing complexity of the ordinals / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the base-dependence of sets of numbers recognizable by finite automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3707407 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Recursive linear orders with recursive successivities / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3949052 / rank | |||
Normal rank | |||
Latest revision as of 11:04, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every recursive linear ordering has a copy in DTIME-SPACE(<i>n</i>,log(<i>n</i>)) |
scientific article |
Statements
Every recursive linear ordering has a copy in DTIME-SPACE(<i>n</i>,log(<i>n</i>)) (English)
0 references
1990
0 references
recursive ordinal
0 references
recursive total orderings over N
0 references
minimal complexity
0 references
time
0 references
space
0 references
0 references
