These are notes from a series of lectures on polynomial-time computation in permutation groups. The notes are fairly self-contained algebraically and algorithmically. Starting with basic issues, such as testing-membership, much of the polynomial-time library is developed. Instances of group-intersection are indicated, with applications to graph isomorphism. Algorithms are given for finding special subgroups including centers, derived series, Fitting subgroups, composition series.