The Turing machines with n states that run longest before they halt. Watch the 2-, 3- and 4-state champions fill a blank tape, and see why no program can compute the record.
This interactive visualization needs JavaScript.