Desirable Complexity

This paper explores the concept of “desirable complexity”, an application of Suh's complexity for fields which want to create problems or challenges rather than eliminating them: puzzles, sabotage, physical security, and unique identification. In these areas, inverting AD complexity theory gives suggestions to making duplication and solution discovery challenging by creating seemingly unsolvable problems.