We prove a converse to one of the theorems from [F], giving a description in terms of Turing complexity of sets which can be coded into recursive and r.e. quotient Boolean algebras.