Standard

Wadge reducibility and infinite computations. / Selivanov, Victor.

In: Mathematics in Computer Science, Vol. 2, No. 1, 01.11.2008, p. 5-36.

Research output: Contribution to journal › Article › peer-review

Harvard

Selivanov, V 2008, 'Wadge reducibility and infinite computations', Mathematics in Computer Science, vol. 2, no. 1, pp. 5-36. https://doi.org/10.1007/s11786-008-0042-x

APA

Selivanov, V. (2008). Wadge reducibility and infinite computations. Mathematics in Computer Science, 2(1), 5-36. https://doi.org/10.1007/s11786-008-0042-x

Vancouver

Selivanov V. Wadge reducibility and infinite computations. Mathematics in Computer Science. 2008 Nov 1;2(1):5-36. https://doi.org/10.1007/s11786-008-0042-x

Author

Selivanov, Victor. / Wadge reducibility and infinite computations. In: Mathematics in Computer Science. 2008 ; Vol. 2, No. 1. pp. 5-36.

BibTeX

@article{13e6194d9dc8453db5540eab65bc109a,
title = "Wadge reducibility and infinite computations",
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. {\textcopyright} 2008 Birkh{\"a}user Verlag Basel/Switzerland.",
keywords = "Automaton, Baire domain, Baire space, Complexity, Computability, Topology, Wadge reducibility, κ-partition, ω-language",
author = "Victor Selivanov",
year = "2008",
month = nov,
day = "1",
doi = "10.1007/s11786-008-0042-x",
language = "English",
volume = "2",
pages = "5--36",
journal = "Mathematics in Computer Science",
issn = "1661-8270",
publisher = "Birkh{\"a}user Verlag AG",
number = "1",

}

RIS

TY - JOUR

T1 - Wadge reducibility and infinite computations

AU - Selivanov, Victor

PY - 2008/11/1

Y1 - 2008/11/1

N2 - 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.

AB - 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.

KW - Automaton

KW - Baire domain

KW - Baire space

KW - Complexity

KW - Computability

KW - Topology

KW - Wadge reducibility

KW - κ-partition

KW - ω-language

UR - http://www.scopus.com/inward/record.url?scp=69949160445&partnerID=8YFLogxK

U2 - 10.1007/s11786-008-0042-x

DO - 10.1007/s11786-008-0042-x

M3 - Article

AN - SCOPUS:69949160445

VL - 2

SP - 5

EP - 36

JO - Mathematics in Computer Science

JF - Mathematics in Computer Science

SN - 1661-8270

IS - 1

ER -

ID: 127087651