> 2) "undecidable" means: you can write an algorithm that checks whether a> given grammar is ambiguous. However, this algorithm may take an> arbitrarily long time to terminate, and for some grammars it will never> reach a conclusion and continue to run forever.

However, by definition, if an "algorithm" runs forever, it is not
an algorithm.