Ladder

De bruijn — the ladder

One essay so far against this idea. A ladder is the distinct arguments that stand against one idea, and this one has room to grow.
  1. The de Bruijn graph on 2 letters and words of 3, and the cycle through it. A graph whose vertices are short words and whose arrows are words one letter longer, with a closed walk using every arrow exactly once marked, and the cyclic sequence it spells.

    Every word once, around a cycle

    A cyclic string of eight bits holds all eight three-bit words, each exactly once — and the reason such a thing exists is that the constraint linking overlapping windows is itself the construction.

    rung 1 · computation

All ladders