Pages that link to "Item:Q1004086"
From MaRDI portal
The following pages link to Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems (Q1004086):
Displaying 14 items.
- Admissibles in gaps (Q2011650) (← links)
- The recognizability strength of infinite time Turing machines with ordinal parameters (Q2011653) (← links)
- Infinite time busy beavers (Q2011657) (← links)
- Taming Koepke's zoo. II: Register machines (Q2067510) (← links)
- Clockability for ordinal Turing machines (Q2106588) (← links)
- Decision times of infinite computations (Q2153830) (← links)
- Weaker variants of infinite time Turing machines (Q2309496) (← links)
- The computational strengths of \(\alpha\)-tape infinite time Turing machines (Q2453073) (← links)
- Infinite Time Turing Machines With Only One Tape (Q2720332) (← links)
- Discrete Transfinite Computation (Q2906573) (← links)
- SOME OBSERVATIONS ON TRUTH HIERARCHIES (Q2940864) (← links)
- Hypermachines (Q3011123) (← links)
- RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY (Q4579818) (← links)
- Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines (Q4995609) (← links)
