Definitions do not have to be computable, even in principle. For example, "a Turing machine that halts" is well-defined although there is no algorithm for class

Definitions do not have to be computable, even in principle. For example, "a Turing machine that halts" is well-defined although there is no algorithm for classifying things into that bin.