imagine27

If a programming language is as powerful as Paul Graham thinks the hundred-year language could be, it will be regulated.

Sold out attendance marked this being the second premiere conference for Clojure.

Overtone is an open source audio environment being created to explore musical ideas from synthesis and sampling to instrument building, live-coding and collaborative jamming.

The first publicly available version of Shen/Kl has been released.

In 1972 Ed Catmull (founder of Pixar) and his colleagues created the world’s first 3D rendered movie, an animated version of Ed’s left hand.

Update : bug-fix when hull was being incorrectly calculated due to there being duplicate points generated in the random set.

In this second post in this series we look at an implementation of the always useful Fast Fourier Transform.

Update 2011/06/28 : Source has been modified to compile with Shen This is the first in a series of posts that will demonstrate the implementation of many well-known(and less known) data structures and algorithms using a purely functional approach.

White paper : To a mathematical theory of evolution and biological creativity We present an information-theoretic analysis of Darwin’s theory of evolution, modeled as a hill-climbing algorithm on a fitness landscape.

Marvin Minksy’s – The Emotion Machine: Commonsense Thinking, Artificial Intelligence, and the Future of the Human Mind Minsky argues that emotions are different ways to think that our mind uses to increase our intelligence.

Qi is the future of Lisp.

Programming language wars don’t have to be religious based wars.

Artificial Intuition – A New Possible Path To Artificial Intelligence – by Monica Anderson Artificial Intelligence was born in Computer Science departments, and inherited their value sets including Correctness.

As an example let’s look at an algorithm that’s fairly common : breadth first traversal of a binary tree.

The implementers of existing Ruby VMs have gone the way of C, C++ and Java.

These days there just can’t be enough said to counter the hype that comes with STM.

// pi_spigot.s - calculates Pi using a spigot algorithm // as an array of n digits in base 10000. // http://mathworld.wolfram.com/SpigotAlgorithm.html // // x86-64/SSE3 with for Linux, Intel, gnu assembler, gcc // // as…

Update 2010-06-30 : So just over a day after I posted this entry Google announced that they have acquired ITA.

“Let over Lambda – 50 Years of Lisp” by Doug Hoyte This one had been sitting on my bookshelf for almost a year.

One popular interview question that never dies : write some code to reverse a singly linked-list.

;; Calculates the convex hull of a set of points using the Graham scan ;; algorithm.

(defn bucket-sort "Runs in O(n) time."

Quotes from Don E.

Here’s a molecule viewer using OpenGL in Clojure.

// pi_x64.s - calculates Pi using the Leibniz formula. // Each iteration prints a closer approximation to 50 digits. // This is not an optimal implementation and it runs forever. // // x86-64/SSE3 with for Linux, Intel, gnu as…

DISCLAIMER : THIS IS A LANGUAGE RANT.

* Update 2009-12-27 * Using lists instead of vectors brings the Clojure version down from around 20x to 10X slower than the CL version.

Sonoluminescence: A Galaxy of Nanostars Created in a Beaker (NASA) The Idea Factory – Learning to Think at MIT, Pepper White : “This is a personal story of the educational process at one of the world’s great technological universities.

Even a superficial study of learning theory can have great value : The following article, “Connectivism: A Learning Theory for the Digital Age” is a great example.

...

A Quine is a program that produces its complete source code as its only output.

A few updates and bug fixes from the first version.

* UPDATED : 2009-09-17 * – rewritten in a functional style that is more idiomatic of Clojure.

Took a shot at implementing a PI digit generator in Clojure using a ‘fast’ algorithm.

The previous Common Lisp and Haskell functions to generate the digits of PI where only accurate between 10000 and 20000 digits.

Haskell beats CL quite comfortably using the same algorithm : module Main( main ) where import System( getArgs ) arccot :: Integer -> Integer -> Integer arccot x unity = arccot' x unity 0 start 1 1 where start = unity `div` x arccot'…

Thanks to metacircular for pointing out that (floor (/ x y)) can be written as (floor x y) while avoiding the intermediate rational.

Update 2009-07-23 : Faster version in CL and a Haskell version. ——————————————————————————– A trivial approximation using the Leibniz formula.

Here’s an implementation of Emacs Lisp’s MAPCONCAT function for Common Lisp.

The last article ended with a challenge hoping that someone would come up with an improved version of the boggle solver that beats my version.

The previous article had some serious traffic yesterday and today.

* Update 2009-05-06 : The challenge has been met !

A Lisp version of the code from this article –> http://iam.elbenshira.com/archives/151_integral-calculus-in-haskell/ ********** For those that are unhappy about this not being a Symbolic Integration example then please read Norvig’s “Paradigms of Artifici…

My curiousity got the better of me tonight.

Andrew Sorenson is doing some beautiful live “Lisp coding as art” with synthesized sound and OpenGL.

Before I go any further : let me state upfront that knowing Lisp has changed me as a programmer for the best.

Ron Garret puts it’s perfectly : “Whatever problems I may have, an unwillingness to learn new things is not one of them.

Brave New World – Aldous Huxley : Re-reading but not from any paradise-engineering paranoia perspective.

More info here with pictures.

Dan Weinreib’s Common Lisp Implementations: A Survey ALU’s Common Lisp Implementations Building stable and scalable high-volume network servers on open-source common CL implementations