On unsolvability of nonlinear system stability

Any algebraically computable function can be expressed as a nonlinear discrete-time system of the form s(k + 1) = f(As(k)), where f(·) is a simple ‘cut’ operation. This result is utilized to demonstrate that there cannot exist any general decision procedure for analysing the stability of systems of the above form.