lambdaphant’s posterous

lambdaphant’s posterous

Michael Matuzak  //  Programmer by day, booze drinking calamari cruncher by night.

Jan 10 / 6:14pm

Lisp quotes

If you give someone Fortran, he has Fortran. If you give someone Lisp, he has any language he pleases.

- Guy L. Steele


[Lisp] is the only computer language that is beautiful.

- Neal Stephenson


http://norvig.com/quotations.html

Loading mentions Retweet
Filed under  //  lisp   quotes  

Comments (0)

Jan 10 / 5:25pm

SICP exercises now on Github

I've realized that blog posts are a less than ideal way to keep track of code exercises. This being the case I've decided to keep track of them with git. You can follow it at github if you like.
 
http://github.com/emkay/sicp-exercises/tree/master
 
git://github.com/emkay/sicp-exercises.git
Loading mentions Retweet
Filed under  //  github   SICP  

Comments (0)

Jan 10 / 5:12pm

Me and a wild beast!

       
Click here to download:
Me_and_a_wild_beast.zip (5955 KB)
Loading mentions Retweet
Filed under  //  photos  

Comments (0)

Jan 7 / 9:25pm

Pascals Triangle

Learning about Pascals triangle for the next SICP exercise.
 

 
Wikipedia Page

Loading mentions Retweet
Filed under  //  math  

Comments (0)

Jan 7 / 8:49pm

SICP Exercise 1.11

Recursive:
 
(define (rf n)
  (if (< n 3)
  n
  (+ (rf (- n 1))
   (* 2 (rf (- n 2)))
   (* 3 (rf (- n 3))))))
 
Iterative:
 
(define (f n)
  (if (< n 3)
  n
  (f-iter 0 1 2 n)))
 
(define (f-iter a b c counter)
  (if (= 0 counter)
  a
  (f-iter b c (+ c (* 2 b) (* 3 a)) (- counter 1))))

 
The iterative one took me a while to figure out. Every time I started I kept reverting back to recursive thinking.

Loading mentions Retweet
Filed under  //  programming   scheme   SICP  

Comments (0)

Jan 6 / 10:23am

Add all new files to svn with sed, grep, and xargs

$ svn st | grep \? | sed "s/\?//" | xargs svn add $1
Loading mentions Retweet
Filed under  //  grep   sed   svn  

Comments (1)

Jan 6 / 9:12am

Discrete Math Resources

Here is the collection of resources that the people at math.reddit
produced for me.
 
http://www.cis.upenn.edu/~jean/gbooks/discmath.html
http://people.csail.mit.edu/meyer/6042-spring07-handouts.pdf
http://www.math.upenn.edu/~wilf/DownldGF.html
http://www.1stworks.com/ref/RuskeyCombGen.pdf
http://www.math.uni-hamburg.de/home/diestel/books/graph.theory/
Loading mentions Retweet
Filed under  //  math  

Comments (0)

Jan 5 / 10:49am

Looking for some discrete math help

See this comment thread to see what has already been suggested.
 
http://www.reddit.com/r/math/comments/7neeu/ask_mathit_what_is_a_decent_discrete_math/
Loading mentions Retweet
Filed under  //  math  

Comments (0)

Jan 5 / 10:07am

MIT Into to Algorithms problem sets

http://www.catonmat.net/blog/mit-introduction-to-algorithms-part-one/#comment-4249
 
This comment from a TA of the MIT Intro to Algorithms class stresses
"the bulk of the learning in this class is in the problem sets. They
are hard. They are very hard. They normally took a good 8+ hours each
for a solid group of 2-4 MIT CS students." I have no doubt that they
are extremely difficult problems, but I do not think that I will be
able to find people to work on problem sets with. In my personal life
I don't really know a ton of people who would be interested in going
through this course and have time to go through the course. I myself
probably don't have the time to really go through this course
seriously. Because of this I will most likely put this on hold until I
have finished the SICP course. Between SICP, work, mapfilter, and life
in general it seems a bit much to add Intro to Algorithms on top of
that. This will give me more time to find some other people that are
interested in working on the problem sets together, and to study some
more math along the way so that I can understand what the hell is
going on.
Loading mentions Retweet

Comments (0)

Jan 4 / 4:53pm

XKCD mention of Ackermann's function

http://xkcd.com/207/

Loading mentions Retweet

Comments (0)