Pages that link to "Item:Q2398210"
From MaRDI portal
The following pages link to On the generic undecidability of the halting problem for normalized Turing machines (Q2398210):
Displaying 5 items.
- On the strongly generic undecidability of the halting problem (Q884482) (← links)
- Bounding lemmata for non-deterministic halting times of transfinite Turing machines (Q2482464) (← links)
- The laterality problem for non-erasing Turing machines on $\lbrace 0,1\rbrace $ is completely solved (Q4349780) (← links)
- Non-erasing turing machines: A new frontier between a decidable halting problem and universality (Q5096346) (← links)
- Logical Approaches to Computational Barriers (Q5898853) (← links)