We show that the minimal area of a convex subset of the plane which contains a congruent copy of any planar subset of diameter $1$ is a computable real number. We do provide a concrete algorithm, although not a practical one. The task of finding this number had been posed by Lebesgue to Pal, who then provide initial bounds that were subsequently improved by a number of researchers.