Explore >> Select a destination
|
You are here 
|
danilafe.com | ||
| | | | |
www.baturin.org
|
|
| | | | | ||
| | | | |
bernsteinbear.com
|
|
| | | | | Compiling Lisp let expressions to x86-64 | |
| | | | |
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? | |
| | | | |
blog.jle.im
|
|
| | | Weblog of Justin Le, covering various adventures in programming and explorations in the worlds of computation physics, and knowledge. | ||
