Kombinator-Y untuk Melakukan Memoizing Fungsi Rekursif | Zendy

Subandijo Subandijo | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Kombinator-Y untuk Melakukan Memoizing Fungsi Rekursif

Author(s) -

Subandijo Subandijo

Publication year - 2012

Publication title -

comtech computer mathematics and engineering applications

Language(s) - English

Resource type - Journals

eISSN - 2476-907X

pISSN - 2087-1244

DOI - 10.21512/comtech.v3i1.2468

Subject(s) - μ operator , fibonacci number , fixed point , combinatory logic , primitive recursive function , function (biology) , computer science , recursive functions , mathematics , discrete mathematics , algorithm , mathematical analysis , programming language , 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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research