An Unbounded Spigot Algorithm for π
I came across an interesting paper regarding an algorithm to generate the digits of π without having to decide ahead of time how many digits you want to produce. A lot of problems of this type are handled with recursion, but since they are dealing with infinity, you have to decide at what point you are going to stop and produce a result. A spigot algorithm work a bit different in that it switches between working on the problem and producing a result. It does so by maintaining a state between calculations
