Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
bodhiandphysics
6 months ago
|
parent
|
context
|
favorite
| on:
Don't implement unification by recursion
no... you can do fibonacci as O(log n)... you cannot represent (1 + sqrt(5))/2 on a computer.
Smaug123
6 months ago
|
next
[–]
You literally just did! The problem is not
representing
the number, it's computing
digits
.
xyzzyz
6 months ago
|
prev
[–]
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
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
