Alan Turing put bounds on what is computable in a famous 1936 paper 1. The Turing machines he presented implement finite algorithms, handling data coded as real numbers. They are deterministic, but ...