par Nobrega, Hugo;Pauly, Arno 
Référence Lecture notes in computer science, 10307 LNCS, page (327-337)
Publication Publié, 2017
Référence Lecture notes in computer science, 10307 LNCS, page (327-337)
Publication Publié, 2017
Article révisé par les pairs
| Résumé : | We introduce generalized Wadge games and show that each lower cone in the Weihrauch degrees is characterized by such a game. These generalized Wadge games subsume (a variant of) the original Wadge game, the eraser and backtrack games as well as Semmes’s tree games. In particular, we propose that the lower cones in the Weihrauch degrees are the answer to Andretta’s question on which classes of functions admit game characterizations. We then discuss some applications of such generalized Wadge games. |
