Unprovability comes to machine learning
How would this affect the practical nature of the problem?  Also, why is this novel?  All machine learning algorithms can be implemented on a Turing machine, so they all are subject to the halting problem.