We give a method for efficiently computing isomorphisms between towers of Artin-Schreier extensions over a finite field. We find that isomorphisms between towers of degree pn over a fixed field Fq can be computed, composed, and inverted in time essentially linear in pn. The method relies on an approximation process.