Pages that link to "Item:Q4487651"
From MaRDI portal
The following pages link to The Length of Infinite Time Turing Machine Computations (Q4487651):
Displayed 15 items.
- Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems (Q1004086) (← links)
- Infinite time extensions of Kleene's \({\mathcal O}\) (Q1031833) (← links)
- Post's problem for ordinal register machines: an explicit approach (Q1032632) (← links)
- Admissibles in gaps (Q2011650) (← links)
- Infinite time busy beavers (Q2011657) (← links)
- Decision times of infinite computations (Q2153830) (← links)
- The computational strengths of \(\alpha\)-tape infinite time Turing machines (Q2453073) (← links)
- Bounding lemmata for non-deterministic halting times of transfinite Turing machines (Q2482464) (← links)
- Weak systems of determinacy and arithmetical quasi-inductive definitions (Q3011112) (← links)
- Determinacy in strong cardinal models (Q3011128) (← links)
- RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY (Q4579818) (← links)
- Measure-theoretic uniformity and the Suslin functional (Q4995604) (← links)
- (Q5109524) (← links)
- GENERICITY AND RANDOMNESS WITH ITTMS (Q5207572) (← links)
- Guest editors' introduction (Q5920212) (← links)