>and as such there's no guarantee that you can represent its behaviour by the current algorithms. Doesn't the universal function approximation theorem provide

>and as such there's no guarantee that you can represent its behaviour by the current algorithms. Doesn't the universal function approximation theorem provide just such a guarantee? It doesn't guarantee any algorithm will converge on that representation, but the capability to represent it is there.