Testing universality [in symbolic systems]
One can tell that a symbolic system is universal if one can find expressions that act like the s and κ combinators, so that, for example, for some expression e, e[x][y][z]
✖
e[x][y][z] evolves to x[z][y[z]]
✖
x[z][y[z]].