The following pages link to Hypermachines (Q3011123):
Displaying 13 items.
- \(P\neq NP\) for infinite time Turing machines (Q1408507) (← links)
- Recognizable sets and Woodin cardinals: computation beyond the constructible universe (Q1694811) (← links)
- Taming Koepke's zoo. II: Register machines (Q2067510) (← links)
- Clockability for ordinal Turing machines (Q2106588) (← links)
- Weaker variants of infinite time Turing machines (Q2309496) (← links)
- Discrete transfinite computation models (Q2906573) (← links)
- Determinacy in strong cardinal models (Q3011128) (← links)
- (Q3289365) (← links)
- Building Infinite Machines (Q4483956) (← links)
- RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY (Q4579818) (← links)
- Machines (Q4907913) (← links)
- (Q5109524) (← links)
- Logical Approaches to Computational Barriers (Q5898830) (← links)