On images of partial computable functions over computable Polish spaces

On images of partial computable functions over computable Polish spaces Full article

Journal

Сибирские электронные математические известия (Siberian Electronic Mathematical Reports)
, E-ISSN: 1813-3304

Output data

Year: 2017, Volume: 14, Pages: 418-432 Pages count : 15 DOI: 10.17377/semi.2017.14.035

Tags

Computable analysis; Computable Polish space; Partial computable function

Authors

Korovina M.V. ¹ , Kudinov O.V. ²

Affiliations

1	A.P. Ershov Institute of Informatics Systems, pr. Acad. Lavrentjev,6, Novosibirsk, 630090, Russian Federation
2	Sobolev Institute of Mathematics, pr. Koptyug, 4, Novosibirsk, 630090, Russian Federation

This paper is a part of the ongoing program on analysing the complexity of various problems in computable analysis in terms of the effective Borel and Lusin hierarchies. We give an answer to the question by A. Morozov and K. Weihrauch that concerns a characterisation of image complexity of partial computable functions over computable Polish spaces. © 2017 Korovina M.V., Kudinov O.V.

Korovina M.V. , Kudinov O.V.
On images of partial computable functions over computable Polish spaces
Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2017. V.14. P.418-432. DOI: 10.17377/semi.2017.14.035 WOS Scopus

Web of science:	WOS:000407792200038
Scopus:	2-s2.0-85074582775

Пока нет цитирований