Noisy Turing Machines

* Final gross prices may vary according to local VAT.

Get Access


Turing machines exposed to a small stochastic noise are considered. An exact characterisation of their (≈ \({\it \Pi}\) \(_{\rm 2}^{\rm 0}\) ) computational power (as noise level tends to 0) is obtained. From a probabilistic standpoint this is a theory of large deviations for Turing machines.