Pages that link to "Item:Q1196205"
From MaRDI portal
The following pages link to Recursively presented games and strategies (Q1196205):
Displaying 16 items.
- A note on degrees of presentation of games as relational structures (Q912772) (← links)
- Countable thin \(\Pi^0_1\) classes (Q1208080) (← links)
- Index sets in computable analysis (Q1292400) (← links)
- Feasible graphs with standard universe (Q1295403) (← links)
- Complexity and categoricity (Q1383162) (← links)
- Structural measures for games and process control in the branch learning model (Q1575709) (← links)
- Effectively closed sets and graphs of computable real functions. (Q1607292) (← links)
- Learning to win process-control games watching game-masters (Q1854518) (← links)
- Complexities of winning strategies in diophantine games (Q1908042) (← links)
- On the lattices of NP-subspaces of a polynomial time vector space over a finite field (Q1923577) (← links)
- Game characterizations and lower cones in the Weihrauch degrees (Q2011671) (← links)
- Weihrauch Degrees of Finding Equilibria in Sequential Games (Q3195703) (← links)
- Game characterizations and lower cones in the Weihrauch degrees (Q5228881) (← links)
- Complexity, decidability and completeness (Q5480615) (← links)
- The complexity of recursion theoretic games (Q5694972) (← links)
- Feasibly categorical models (Q6064288) (← links)