Friedberg's and (independently) Muchnik's solution to Post's problem, showing there are Turing degrees between 0 and 0', by inventing the priority-injury method.

Barrington's theorem in complexity theory, about width-5 branching programs being more powerful than people had expected. The "5" is special because the alternating group A5 is unsolvable, but A4 is not.