Wadge Reducibility and Infinite Computations

被引：12
|
作者：
Selivanov, Victor [1 ]
机构：
[1] Russian Acad Sci, Siberian Div, AP Ershov Inst Informat Syst, Lavrentiev Av 6, Novosibirsk 630090, Russia
来源：
MATHEMATICS IN COMPUTER SCIENCE | 2008年 / 2卷 / 01期
关键词：
Wadge reducibility; topology; Baire space; Baire domain; computability; complexity; omega-language; k-partition; automaton;
D O I：
10.1007/s11786-008-0042-x
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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.
引用
收藏
页码：5 / 36
页数：32
相关论文
共 50 条
12345