On Sets ${\mathcal X} \subseteq$ $\mathbb N$ Whose Finiteness Implies That We Know an Algorithm Which for Every $n \in \mathbb N$ Decides the Inequality $\max(\mathcal X)<n$