Download PDFOpen PDF in browserUltrametric automata and Turing machines15 pages•Published: June 22, 2012AbstractWe introduce a notion of ultrametric automata and Turing machines using p-adic numbers to describe random branching of the process of computation. These automata have properties similar to the properties of probabilistic automata but complexity of probabilistic automata and complexity of ultrametric automata can differ very much.Keyphrases: models of computation, p adic numbers, probabilistic algorithms In: Andrei Voronkov (editor). Turing-100. The Alan Turing Centenary, vol 10, pages 98-112.
|