Here's a sort of related argument (very much not a math expert here): Any well ordering on the real numbers must be non-computable. If there was a computable order, you could establish a 1-1 correspondence between the natural numbers and the reals (since each real would be emitted on the nth step of the algorithm).
Is that remotely right?
Well, yes, but mostly because most real numbers cannot ever be specified to an algorithm or received back from it. So you are right, ordering of R is about incomputable things.
The difference here is that we talk about ZFC formulas which can include quite powerful tricks easily.
From Costanza's original thread (entire text):
Meta: