Return to Revisions

My understanding is that the principal motivation for the Blum Shub Smale model of computability is precisely the kind of concern you raise in your question. The dynamicists wanted a theoretical model of computability that would avoid the effects such as round-off error that had plagued a discrete computational implementation of a continuous algorithm. The BSS model is provably different from the model of computable analysis.