The paper on computable presentations of separable Lebesgue spaces raises a foundational question that remains unresolved: given an arbitrary computable metric space X equipped with a computable measure, can we always construct a computable presentation of the associated L1 function space over X? A computable presentation means an explicit, algorithmic enumeration of a dense sequence along with computable distance information, allowing computability theory to interact meaningfully with classical analysis. While specific cases such as the unit interval with Lebesgue measure are understood, the general landscape of which measure spaces yield computable L1 presentations and which do not remains murky, and no clean characterization is known.