This is a survey of results about Wadge reducibility in some spaces and its relation to the study of infinite (non-terminating) computations. We also discuss the related techniques and directions of future research. © 2008 Birkhäuser Verlag Basel/Switzerland.
Original languageEnglish
Pages (from-to)5-36
Number of pages32
JournalMathematics in Computer Science
Volume2
Issue number1
DOIs
StatePublished - 1 Nov 2008

    Research areas

  • Automaton, Baire domain, Baire space, Complexity, Computability, Topology, Wadge reducibility, κ-partition, ω-language

ID: 127087651