The set of ambiguous CFGs is not computable, but that has no bearing on a particular grammar. Some grammars are clearly ambiguous. Some grammars are clearly unambiguous.

The uncomputability of the set of ambiguous CFGs says that it is not possible to write a computer program that reads a CFG G and tells you whether G is ambiguous, where your program works correctly for every grammar.