Pages that link to "Item:Q2453073"
From MaRDI portal
The following pages link to The computational strengths of \(\alpha\)-tape infinite time Turing machines (Q2453073):
Displaying 5 items.
- Koepke machines and satisfiability for infinitary propositional languages (Q2011652) (← links)
- Towards computable analysis on the generalised real line (Q2011660) (← links)
- Realisability for infinitary intuitionistic set theory (Q2700803) (← links)
- Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines (Q4995609) (← links)
- (Q5109524) (← links)
