> Just don't try to frame your conclusions as objective truth, or known scientific results like the GP.

To clarify this objection is to @nyrikki's (incorrect) claim that "NLU is an example of a problem that is thought to be impossible for Turing machines/algorithms" and not to anything that @drdeca said right?

I think you are agreeing emphatically with @drdeca but it's possible to read this comment as an objection to @drdeca (NLU may not be as trivial as claimed - ha).