[emorning3]

>>Another way to see it is that the set of valid theorems in FOL is uncomputable.<<

I've never seen it put that way exactly. And I've never learned the gory details of the incompleteness proofs and I've never made the explicit connection between incompleteness and computation before. That blew my tiny pea brain :-).

Now that I've read the Wikipedia page, I guess I only understood incompleteness as the 2nd theorem.

https://en.wikipedia.org/wiki/G%C3%B6del%27s_incompleteness_...

Thanks!