Name
Abstract | ||
|---|---|---|
Rabin has given an example of a game with recursive rules but no recursive winning strategy. We show that such a game always has a hyperarithmetical winning strategy, but arbitrarily high levels of the hyperarithmetical hierarchy may be needed. We also exhibit a recursively enumerable game which has no hyperarithmetical winning strategy. |
Year | DOI | Venue |
|---|---|---|
1972 | 10.1016/0012-365X(72)90086-6 | Discrete Mathematics |
Keywords | Field | DocType |
mathematics | Discrete mathematics,Combinatorics,Recursively enumerable language,Hierarchy,Recursion,Mathematics | Journal |
Volume | Issue | ISSN |
3 | 4 | Discrete Mathematics |
Citations | PageRank | References |
4 | 0.49 | 0 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andreas Blass | 1 | 4 | 0.49 |