Re: [Haskell-cafe] Fibonacci numbers generator in Haskell

Spencer Janssen writes (in the Haskell Cafe):

Here's some code I wrote a while back for computing the nth Fibonacci number. It has O(log n) time complexity [..]

The nth Fibonacci number has O(n) digits. Cheers, Ronny Wichers Schreur