Kombinator-Y untuk Melakukan Memoizing Fungsi Rekursif
This article discusses how to find a solution of a recursive function such as Fibonacci or factorial numbers without repetition. Therefore, a recursive function is considered a fixed-point of non-recursive function. To calculate the fixed-point, we can use Y Combinator, a non-recursive functions to...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Bina Nusantara University
2012-06-01
|
| Series: | ComTech |
| Subjects: | |
| Online Access: | https://journal.binus.ac.id/index.php/comtech/article/view/2468 |