Recall that a term that cannot take a step under the evaluation relation is called a normal form. Interestingly, some terms cannot be evaluated to a normal form. For example, the divergent combinator $\omega = (\lambda x. x x) (\lambda x. x x)$ contains just one redex, and reducing this redex yields exactly $\omega$ again! Terms with no normal form are said to diverge.
bottom = bottom