Open AccessKombinator-Y untuk Melakukan Memoizing Fungsi Rekursif
Author(s) -
Subandijo Subandijo
Publication year - 2012
Publication title -
comtech/comtech
Language(s) - English
Resource type - Journals
eISSN - 2476-907X
pISSN - 2087-1244
DOI - 10.21512/comtech.v3i1.2468
Subject(s) - μ operator , computer science , combinatory logic , fibonacci number , fixed point , function (biology) , primitive recursive function , repetition (rhetorical device) , recursive functions , algorithm , mathematics , discrete mathematics , programming language , mathematical analysis , linguistics , philosophy , evolutionary biology , biology
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 perform memoizing recursive function. This method can significantly reduce the execution time of recursive functions.