Pages that link to "Item:Q5898823"
From MaRDI portal
The following pages link to Logical Approaches to Computational Barriers (Q5898823):
Displaying 14 items.
- Recognizable sets and Woodin cardinals: computation beyond the constructible universe (Q1694811) (← links)
- Characterizations of ITBM-computability. I (Q2026737) (← links)
- Taming Koepke's zoo. II: Register machines (Q2067510) (← links)
- The lost melody theorem for infinite time Blum-Shub-Smale machines (Q2117767) (← links)
- The basic theory of infinite time register machines (Q2267751) (← links)
- On fixpoint arithmetic and infinite time Turing machines (Q2390295) (← links)
- The distribution of ITRM-recognizable reals (Q2453067) (← links)
- Optimal results on recognizability for infinite time register machines (Q2795911) (← links)
- Time-Symmetric Machines (Q2868446) (← links)
- Hypermachines (Q3011123) (← links)
- An Enhanced Theory of Infinite Time Register Machines (Q3507445) (← links)
- Building Infinite Machines (Q4483956) (← links)
- Infinite time Turing machines (Q4508248) (← links)
- RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY (Q4579818) (← links)