A link in $S^3$ is said to be slice if it bounds a collection of flat disks into the $4$-ball. Here "flat," means that there is a (locally) trivial normal bundle. This condition can be strengthened to "smoothly slice," meaning that the link bounds a smooth collection of disks. Even more restrictive is the condition of "ribbon," which means that the link bounds a collection of disks with only local maxima, and no local minima, as one moves into the $4$-ball. Thus we have an increasingly subtle series of questions. Is the link topologically slice? Is it smoothly slice? Is it ribbon? As far as I know, there are no algorithms for all three of these questions. My question is whether this is really true. For example, is there an algorithm to detect whether a link is ribbon? One interesting and venerable open problem in the field is whether all slice links are ribbon. This paper gives a sequence of examples of links which are smoothly slice but not obviously ribbon. If there were an algorithm for detecting "ribbonness," then one could apply it to these examples, and possibly disprove the slice=ribbon conjecture. It seems to me that detecting ribbon disks should not be that hard, perhaps using ideas akin to normal surface theory. You would just be looking for disks in the link complement with ribbon singularities. Has anyone thought about this?