This talk is intend to give a review on the computation of the simplest normal forms (SNF) of differential equations. After a brief introduction, attention will be focused on the development of efficient methods for computing the SNF with the aid of computer algebra systems. A number of singularities will be presented. ``Automatic'' symbolic computer programs using Maple will be discussed, showing the high potential of using the SNF to solve complex dynamical systems.