Explore >> Select a destination
|
You are here 
|
www.chriswarbo.net | ||
| | | | |
simeonfranklin.com
|
|
| | | | | Simeon Franklin - Web Developer | |
| | | | |
adv-r.had.co.nz
|
|
| | | | | ||
| | | | |
www.oranlooney.com
|
|
| | | | | I recently wrote an article which was ostensibly about the Fibonacci series but was really about optimization techniques. I wanted to follow up on its (extremely moderate) success by going in the exact opposite direction: by writing a Fibonacci function which is as slow as possible. This is not as easy as it sounds: any program can trivially be made slower, but this is boring. How can we make it slow in a fair and interesting way? | |
| | | | |
jao.io
|
|
| | | [AI summary] The author explores the Y combinator and fixed-point combinators in lambda calculus, demonstrating how to implement recursive functions like list-length in Scheme using beta abstraction to manage a strict evaluation strategy. | ||
