Thursday, August 30, 2012

Getting started!

In this blog I'll wrote about things that surprise and amuse me in computer science, programming languages theory and practice, mathematics, science and technology.

About the title

In programming languages theory, the "Y combinator" (also called the "fixed point combinator") is a higher-order function that allows encoding recursion without self-reference (i.e. without defining a name in terms of itself); this is useful in giving meaning to recursive definitions in a way that is mathematically precise. You can read more about it in the Wikipedia article

No comments:

Post a Comment