The computational strengths of \(\alpha\)-tape infinite time Turing machines (Q2453073): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Infinite time Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite Time Turing Machines With Only One Tape / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite time extensions of Kleene's \({\mathcal O}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing Computations On Ordinals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinal Computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinal machines and admissible recursion theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Theory of Infinite Time Blum-Shub-Smale Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set theory. An introduction to independence proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Approaches to Computational Barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Length of Infinite Time Turing Machine Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Transfinite Computation / rank
 
Normal rank

Revision as of 13:50, 8 July 2024

scientific article
Language Label Description Also known as
English
The computational strengths of \(\alpha\)-tape infinite time Turing machines
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references