Algorithm for computing unknotting numbers

Develop an algorithm that computes the unknotting number of every knot.

Background

The unknotting number is defined by minimizing over all diagrams of a knot, so calculations on a single diagram do not generally determine the invariant. The paper notes that existing methods combine theoretical obstructions with explicit diagrammatic constructions, but a general computational procedure is not available.