Skip to main content
SpringerLink
Log in

Wadge Reducibility and Infinite Computations

  • Published:
Mathematics in Computer Science Aims and scope Submit manuscript

Abstract.

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. A.P. Ershov Institute of Informatics Systems, Siberian Division Russian Academy of Sciences, Lavrentiev Av. 6, 630090, Novosibirsk, Russia

    Victor Selivanov

Authors
  1. Victor Selivanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Victor Selivanov.

Additional information

Supported by DFG-RFBR Grant 06-01-04002 and by RFBR grant 07-01-00543a.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Selivanov, V. Wadge Reducibility and Infinite Computations. Math.comput.sci. 2, 5–36 (2008). https://doi.org/10.1007/s11786-008-0042-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11786-008-0042-x

Mathematics Subject Classification (2000).

Keywords.

Search

Navigation