1. The uncomputable, the nonconstructive and the undecidable in mathematical economics -- 2. Advanced computational complexity theory from an elementary standpoint -- 3. Economic dynamics and computation : recursion theoretic foundations for the Icarus tradition -- 4. Let's take the con out of...

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.