The following pages link to (Q4381408):
Displaying 4 items.
- Definability as hypercomputational effect (Q2497876) (← links)
- Turing Jumps Through Provability (Q3195699) (← links)
- Non-erasing turing machines: A new frontier between a decidable halting problem and universality (Q5096346) (← links)
- Beyond Rogers’ Non-constructively Computable Function (Q5326358) (← links)