Share via


Code Monkey Have Fun

The Humans Are Dead

Sadly, Microsoft has decided to kill the MSR Robotics team... My last day is today.All that remains...

Date: 09/21/2014

Multiply-step Instruction

Fourth in a series on colorForth and GreenArrays hardware. This time, how the multiply-step...

Date: 11/10/2013

Programming the F18

Programming the F18 As we saw in the last post, the GA144 chip is an array of 144 tiny computers or...

Date: 10/13/2013

Speech Grammars in F#

People say that Vim keys are a grammar for talking to your editor and that's exactly what they are....

Date: 09/19/2013

Memoization

Don Syme blogged this quite some years ago but it just came up in a design review on my team this...

Date: 04/26/2013

Colemak

I switched to Colemak a couple of years ago. I love it. Never going back. Not really any faster than...

Date: 03/30/2013

If you can’t beat ‘em, join ‘em

I’ve had fun making the little DCPU emulator (past couple of posts: 1, 2), but sadly, I’ve had no...

Date: 04/17/2012

What’s a computer without I/O? Hot Silicon At Best…

[FYI: Matt Hellige’s excellent GoForth runs on this] I’m completely astonished at how quickly a...

Date: 04/14/2012

Notch is Gonna Outdo Himself!

[Note: I/O has now been added] My son is completely obsessed with Minecraft. It’s an amazing game...

Date: 04/04/2012

Turtle Graphics on the Fignition

The Fignition board is a fun little piece of 8-bit fun I tell ya! I’ve been having a blast...

Date: 02/18/2012

Introducing the Cult of the Bound Variable to the Cult of Forth

[The twelfth in a series of posts on the evolution of TransForth]   It’s been quite fun playing...

Date: 01/07/2012

Lego KinNXT

I’ve been having some fun playing with the Kinect SDK and the Lego NXT kit. The protocol to talk to...

Date: 12/23/2011

Programming a 2000 Year Old Sandstone Computer

[The eleventh in a series of posts on the evolution of TransForth] If you think coding with punch...

Date: 09/18/2011

Going “Retro” and Loving It!

Continuing my concatenative language kick, I’ve been having fun playing with Retro...

Date: 08/15/2011

Project Euler Problem #14

Longest hailstone sequence with starting number under one-million. let hailstone n = Seq.unfold...

Date: 06/08/2011

Spanning Two Worlds

[The ninth in a series of posts on the evolution of TransForth] The dictionary we have at the moment...

Date: 03/30/2011

Heart Transplant

[The eighth in a series of posts on the evolution of TransForth] They say that the inner interpreter...

Date: 03/26/2011

Tearing Away the Scaffolding

[The seventh in a series of posts on the evolution of TransForth] At this point we have a reasonably...

Date: 02/18/2011

: LOOPTY DO I . LOOP ;

[The sixth in a series of posts on the evolution of TransForth] There’s beginning to be more...

Date: 02/06/2011

IF … ELSE … THEN

[The fifth in a series of posts on the evolution of TransForth] Sadly (or happily), we’ve come...

Date: 02/04/2011

VARIABLE X

[The fourth in a series of posts on the evolution of TransForth] We’re getting very close to...

Date: 02/02/2011

8-Queens in 8 Lines

Brushing up on “whiteboard coding” for internal interviews… Inspired by Hal...

Date: 10/06/2010

Fixing Decades-old Bugs in the HP-35

[Part 2 of the HP Calc series] Making the JavaScript-based HP-35 microcode emulator has been a fun...

Date: 09/27/2010

FScheme - Scheme in F#

[Part 1 of the FScheme series] One of my New Year’s goals is to re-read Lisp in Small Pieces...

Date: 09/24/2010

Project Euler Problem #13

First ten digits of sum of following one-hundred 50-digit numbers. It would be interesting to do...

Date: 09/22/2010

Project Euler Problem #12

First triangle number to have over five hundred divisors. let naturals = Seq.unfold (fun i ->...

Date: 09/21/2010

Project Euler Problem #11

Greatest product of four adjacent numbers (up, down, left, right, or diagonally) in this 20x20 grid:...

Date: 09/21/2010

Project Euler Problem #10

Sum of primes below two-million. Easy problem, but way too slow (taking several minutes) with the...

Date: 09/17/2010

Project Euler Problem #9

Pythagorean triplet where a + b + c = 1000 (2, 1) |> Seq.unfold (fun (m, n) –>...

Date: 09/16/2010

Project Euler Problem #8

Largest products of five consecutive digits in this 1000-digit number. open System.Numerics let...

Date: 09/15/2010

Wolfram – A New Kind of Turing Machine

Stephen Wolfram’s book, “A New Kind of Science” is flippin’ brilliant! (or...

Date: 06/08/2010

Playing Dice with the Universe

[Part 11 of the FScheme series] We’re now taking the first small step into the world of...

Date: 02/21/2010

Recursion Is The New Iteration

I remember the strange feeling as a kid the first time I saw structured BASIC after having been...

Date: 02/06/2010

Next>