Answering a question of J. Lawson (formulated also earlier, in 1984, by Kamimura and Tang [Theoret. Comput. Sci. 34 (1984) 275–288]) we show that every Polish space admits a bounded complete computational model, as defined below. This results from our construction, in each Polish space 〈X,τ 〉, of a countable family C of non-empty closed subsets of X such that: (cp) each subset of C with the fin...