@pcwalton Is the closed form accurate over the whole non-overflowing domain?
-
-
-
@richfelker I'm not sure.
End of conversation
New conversation -
-
-
@pcwalton Why do you ask? -
@jarrednicholls A cross-language Fibonacci benchmark is on HN :) - 1 more reply
New conversation -
-
-
@pcwalton the Haskell supercompilation efforts (@ndm_haskell and@mbolingbroke's) would do that implicitly, but not as a special case -
@copumpkin@pcwalton@mbolingbroke supercompilers can go from O(2^n) to O(n), but can't get to O(log n) http://www.nayuki.io/page/fast-fibonacci-algorithms …
End of conversation
New conversation -
-
-
@pcwalton@walkingrandomly i heard rumours that a certain ML compiler could turn the exponential running time form into the linear form.Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@pcwalton@walkingrandomly Yeah, the compiler Volkswagen use for their engine software...Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.