Re: Lengthy numbers

ram@zedat.fu-berlin.de (Stefan Ram) writes:

  So in theory, this would crank out an infinite list that looks like
  [0, 0, 0, 0, ...]. In the real world, though, if you try to print or
  use this list, your program will probably freeze up faster than the
  405 at rush hour.

The freeze-up happens as soon as you create the list.  Unfortunately
iterators don't have anything like .extend so I don't see a way to
create recursive ones like that, short of writing more verbose code
using yield.  In Haskell it is straightforward:

    fibonacci = 0 : 1 : zipWith (+) (tail fibonacci)

    main = print (take 10 fibonacci)

should print [0,1,1,2,3,5,8,13,21,34].