Under a natural substitution operation simple permutations are the building blocks for all permutations. They are particularly related to pattern classes which are algebras under the substitution operation. The talk will survey the basic theory, give some results about how simple permutations can be used in enumeration questions, present some enumerations of simple permutations, and discuss a theorem on the algebraic closures of principal pattern classes.