Whereas permutation groups can be analysed by computer through their subgroup structure, in the case of matrix groups defined over finite fields we have to use the normal subgroup structure. This makes the basic machinery for computing with matrix groups far more subtle than the corresponding machinery for permutation groups, with particular emphasis on simple groups. I shall give an outline of the approach used, aimed at the non-specialist.