Thoughts
I think, that part of the reason that programming languages don't support out-of-the-box exact arithmetic is that it's possible to construct
arbitrarily "complex" numbers.
something something Gödel's Incompleteness Theorem, "There is no recursively related notation-system which gives a name to every constructive ordinal" -Church and Kleene (from GEB)