One of my favorite moments in life was when I was ambigrammed by the great Scott Kim. He created the interactive piece in Flash (so it’s not visible anymore) but I captured it as a GIF.

# Author Archives: John Maeda

## Recursion and Basic Multiplication

## Jean Bartik and ENIAC’s Stored Software

But what the women of ENIAC soon showed, and the men later came to understand, was that the programming of a computer could be just as significant as the design of its hardware. —Walter Isaacson

## Dr. Gertrude Blanch and the Works Progress Administration (WPA) Mathematical Tables Project

## Orders of Complexity

I wish I had this table back in 1984 when I was trying to understand this stuff. Big O Notation Name Example(s) O(1) Constant # Odd or Even number,# Look-up table (on average) O(log n) Logarithmic # Finding element on sorted array with binary search O(n) Linear # Find max element in unsorted array,# Duplicate elements in array with Hash Map […]

## How To Speak Machine

Phew. I just finished the final draft for HTSM, or “How To Speak Machine,” so it looks like it’ll get published by the end of this year. Pre-order Now Amazon | Barnes and Noble | IndieBound

## Paul Baran: Distributed Networks

In 1962, U.S. authorities considered ways to communicate in the aftermath of a nuclear attack. How could any sort of “command and control network” survive? Paul Baran, a researcher at RAND, offered a solution: design a more robust communications network using “redundancy” and “digital” technology. —Rand Corp

## How The Internet Works

This little sitelet at Stanford is my favorite read on this subject. It’s help me re-find my way:

## Wolfram’s Rule 30 and the Conus Textile

It’s the hard to beat the eery feeling of studying Wolfram’s Rule 30.

## Is The Local Maximum Good Or Bad?

Local maxima create value while iterating cheaply, but innovation requires the costly pursuit of global maxima.