Recent correspondence (Fall, 1998) in LifeMail dealt with the possiblity of ``universal computation'' using Wolfram's (2,1) cellular automaton Rule 110. While awaiting further details participants in the list were referred to an eight page prospectus written by Matthew Cook cataloging the known gliders for the rule. Some of the commentary surrounding his introduction is reproduced and elaborated here, namely the results of the survey of the properties of Rule 110 carried out via the cellular automaton program NXLCAU21. Since then, we have played with glider collisions, and examined Rule 110 from the point of view of tiling the plane with isosceles right triangles.