[fennecs]

Basically the article is just lazy evaluation like in Haskell working with infinite lists. Numbers like Pi, e, sqrt(2) are the programs that generate them. However we use syntactic sugar, or just a compact notation, to represent that program or algorithm. It’s useful to be able to glue all these calculations together, a bit like lazy evaluation, or working with generators. Some programs we have some guarantee, we can probe to arbitrary depths and will have a consistent result, eg Pi. However in general for two random real numbers it’s undecidable if they are even equivalent.