The prototypical use of “classical” connectionist models (including the multilayer perceptron (MLP), the Hopfield network and the Kohonen self-organizing map) concerns static data processing. These classical models are not well suited to working with data varying over time. In response to this, temporal connectionist models have appeared and constitute a continuously growing research field. The purpose of this chapter is to present the main aspects of this research area and to review the key connectionist architectures that have been designed for solving temporal problems.