Pages that link to "Item:Q2482464"
From MaRDI portal
The following pages link to Bounding lemmata for non-deterministic halting times of transfinite Turing machines (Q2482464):
Displaying 4 items.
- Decision times of infinite computations (Q2153830) (← links)
- Halting time is predictable for large models: a universality property and average-case analysis (Q2697399) (← links)
- Non-erasing turing machines: A new frontier between a decidable halting problem and universality (Q5096346) (← links)
- Logical Approaches to Computational Barriers (Q5898853) (← links)