My Most Recent Tattoo

define (fibs n)
(cond ((< n 2) n)
(else (+ (fibs (- n 1))
(fibs (- n 2))))))

This entry was posted
on Friday, July 13th, 2007 at 5:33 pm and is filed under Geek, Hipster.
You can follow any responses to this entry through the RSS 2.0 feed.
You can leave a response, or trackback from your own site.
That is so many flavors of awesome, I don’t know where to begin.
whaaa? are you sure you will be allowed to take your final exam with that on your arm?
I like the principle but don’t know what it means.
I frickin’ love XKCD. I can’t believe you did that.
I also PBF but you’re likely aware.
Jason (yes, that Jason)
what does it mean??????? In English..
[...] tattoo ever. (If I understood the equation, I’d want one [...]
That is the most hardcore fucking thing I have ever seen.
Is that for when you get older, and you can’t ‘c’ as well as you used to?
Wow that is so nerdy. I love it and I don’t even know what it means.
It’s a bit of scheme code. It reproduces a famous number sequence (quite inefficiently, but hey …)
Find an interpreter and plug it in.
Oh, and the only scheme-based CS class I ever took (something about building interpreters – can’t remember exactly) had that code on the midterm – but we had to explain why it was inefficient and how to improve it.
Awesome! A girl who likes Lisp?
Nice tattoo
I’m writing a post about interesting tattoos (my blog is in Hebrew, but you’re welcome to take a look). Can I use your pic?
Nice tattoo! It’s cool to have a tattoo that means something.
You young people are sick. And that goes for my three daughters and all their tatoos and piercings.
[...] Sometimes I really respect people Filed under: nowhere else to go — ictow @ 5:06 pm http://www.pinkhairedgirl.com/?p=2680 [...]
[...] התמונה שייכת ל-pinkhairedgirl [...]
cool!
that’s all i can add for now or http://www.ccs.neu.edu/home/matthias/Images/parens.png in case your blog doesn’t do html (references).
– Matthias
It is the Fibonacci sequence – it is found in nature, the petals of flowers, it is ancient in origin.
Code Does:
the sun of the two previous numbers. The scheme code gives you the Fibonacci number for the place for example:
guile> (fibs 10)
55
guile> (fibs 14)
377
Fibonacci numbers: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377
That’s the slow, stack-intensive recursive method.
An iterative (tail-recursive) method with an “aux” variable would be much faster . . .
(define (fibo n , f)
(set ‘f ‘(1 0))
(dotimes (i n)
(push (+ (f 0) (f 1)) f) -1)
(rest f))
from http://newlisp.org/CodePatterns.html