In this paper we discuss the problem of simplifying unnested radical expressions. We describe an algorithm implemented in MACSYMA that simplifies radical expressions and then follow this description with a formal treatment of the problem. Theoretical computing times for some of the algorithms are briefly discussed as is related work of other authors.