# Time is Neutral

## Notes and thoughts on computing, mathematics, and anything else I can write about.

##### Connect

Paul English is a student and software developer in Salt Lake City.

#### 06 November 2013

The euclidean algorithm can be used to calculate greatest common divisors from a group of numbers. It can be implemented recursively using subtraction or division. We'll have a look at trying out both of those methods in Clojure, as well as how to do it using a functional operator. We'll also make the function work for 2 or more arguments.

#### 01 November 2013

First of all don't use emacs. It will cripple every editor (with slight exception to vim) you come across in the future. You will never come across an IDE and think to yourself this is awesome, simply because you know the editor it has will never meet emacs in raw power.

But that's not all, if you do accidently use emacs, whatever you do don't use org-mode. It's a productivity tool to end all productivity tools. It has a decent learning curve and a boatload of functionality that you just can't find in other tools. And it's all for working on plaintext files.

#### 16 August 2013

Ben Mabey recently gave a presentation introducing some of the concepts of Clojure to a Java audience. If you're new to Clojure or even if you've got some experience with it, you'll want to have a look through his slides, the presentation was great.