On images of partial computable functions over computable Polish spaces

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.