On images of partial computable functions over computable Polish spaces

摘要

This paper is a part of the ongoing program on analysingthe complexity of various problems in computable analysis in terms of theeffective Borel and Lusin hierarchies. We give an answer to the questionby A. Morozov and K. Weihrauch that concerns a characterisation ofimage complexity of partial computable functions over computable Polishspaces.