top | item 41975424 (no title) bodhiandphysics | 1 year ago no... you can do fibonacci as O(log n)... you cannot represent (1 + sqrt(5))/2 on a computer. discuss order hn newest Smaug123|1 year ago You literally just did! The problem is not representing the number, it's computing digits. xyzzyz|1 year ago You totally can. Here is a O(log n) implementation of the Binet formula with infinite precision:https://github.com/xyzzyz/FibBinet/blob/master/FibBinet.hs
Smaug123|1 year ago You literally just did! The problem is not representing the number, it's computing digits.
xyzzyz|1 year ago You totally can. Here is a O(log n) implementation of the Binet formula with infinite precision:https://github.com/xyzzyz/FibBinet/blob/master/FibBinet.hs
Smaug123|1 year ago
xyzzyz|1 year ago
https://github.com/xyzzyz/FibBinet/blob/master/FibBinet.hs