This paper discusses the complexity and computability of the ‘Deissenberg Problem’ of finding the ‘best’ point in the efficient set. It is shown that the problem is computably undecidable and that the efficient set of the problem is algorithmically complex.