Simplification of expressions in computer algebra systems

Problems with simplification in current computer algebra systems is discussed, including the insolvability of simplification, the lack of an ideal canonical form, loss of mathematical correctness, lack of an aggressive search, and lack of common identities. Various possible solutions are discussed. An improved method of simplifying mathematical expressions in the Maple computer algebra system is developed