Image displayed was a koala instead of chosen photo of me on a riding lawn...– best support ticket I’ve gotten in a while.
Why I Still Use Emacs →
Uses for Git →
This ain’t your daddy’s distributed version control system
The Fibonacci sequence can be defined as follows: fib(n) = fib(n - 1) + fib(n - 2) fib(2) = fib(1) = 1 and explained as follows: each fibonacci number n is the sum of the two previous numbers in the sequence The Fibonacci sequence is a classic example of recursion, as the function of getting a Fibonacci number requires using the function itself. however, what if we applied the idea...
A Senseless Conversation →
amazing and downright creepy story about artificial intelligence and building a machine that can pass the Turing test.
You are really talking about technical debt. Maybe a metaphor would help your...– Kevin Cline
Shit programmers say →
siwoti: Following up the software development theme, here’s shit programmers say: https://www.youtube.com/watch?v=8WZr6fvtEgk&feature=youtu.be