Pages that link to "Item:Q1393224"
From MaRDI portal
The following pages link to On some games which are relevant to the theory of recursively enumerable sets (Q1393224):
Displaying 23 items.
- Gurevich-Harrington's games defined by finite automata (Q685082) (← links)
- Extension of Gurevich-Harrington's restricted memory determinacy theorem: A criterion for the winning player and an explicit class of winning strategies (Q752703) (← links)
- On effectively computable realizations of choice functions (Q1072545) (← links)
- \(r\)-maximal major subsets (Q1248505) (← links)
- Some lowness properties and computational complexity sequences (Q1255315) (← links)
- Definable properties of the computably enumerable sets (Q1295410) (← links)
- Structural measures for games and process control in the branch learning model (Q1575709) (← links)
- Short lists with short programs in short time (Q1745959) (← links)
- Iterated trees and fragments of arithmetic (Q1892096) (← links)
- Priority constructions (Q1923576) (← links)
- A game-theoretic equivalence to the Hahn-Banach theorem (Q2640469) (← links)
- Formalism and intuition in computability (Q2941588) (← links)
- A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets (Q3880826) (← links)
- Recursively enumerable complexity sequences and measure independence (Q3901505) (← links)
- Recursively enumerable sets and degrees (Q4184825) (← links)
- Infinitary self-reference in learning theory (Q4290127) (← links)
- Diagonals and -maximal sets (Q4292592) (← links)
- Codable sets and orbits of computably enumerable sets (Q4391418) (← links)
- Automorphisms of the lattice of recursively enumerable sets (Q4767305) (← links)
- A General Framework for Priority Arguments (Q4847389) (← links)
- The nonlow computably enumerable degrees are not invariant in $\mathcal {E}$ (Q4913812) (← links)
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES (Q5207571) (← links)
- The complexity of recursion theoretic games (Q5694972) (← links)
