Pages that link to "Item:Q1138912"
From MaRDI portal
The following pages link to On the complexity of \(\omega\)-type Turing acceptors (Q1138912):
Displaying 5 items.
- Real functions and numbers defined by Turing machines (Q1050122) (← links)
- Init and Anf operating on \(\omega\)-languages (Q1056238) (← links)
- Alternation and \(\omega\)-type Turing acceptors (Q1088417) (← links)
- Somewhat finite approaches to infinite sentences. (Q1353892) (← links)
- Computability and realizability for interactive computations (Q2343137) (← links)
