They belong to the class of evolutionary algorithms and evolutionary computation. There exists algorithms that tolerate errors in the input or during the computation. MacLennan considers continuous spatial automata as a model of computation. Optical or photonic computing uses photons produced by lasers or diodes for computation. These probabilistic techniques are closely related to Approximate Bayesian Computation (ABC). A few examples are matrix inversion, eigenvector computation, and differential equation solving. This result is important in understanding the limits of quantum computation. This operation is often computationally cheaper than the explicit computation of the coordinates. These include simulated annealing, cross-entropy search or methods of evolutionary computation. BST has applications to Bell's theorem, quantum computation and quantum gravity. Monte Carlo methods provide a way out of this exponential increase in computation time. Abiteboul designed a crawling strategy based on an algorithm called OPIC (On-line Page Importance Computation). "Deterministic" refers to the uniqueness of the computation run. Thus, Turing machines prove fundamental limitations on the power of mechanical computation. It has important relations to the theory of computation and semantics.