Sciweavers

Share
DLT
2013

Ultrametric Finite Automata and Turing Machines

4 years 1 months ago
Ultrametric Finite Automata and Turing Machines
We 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.
Rusins Freivalds
Added 19 May 2015
Updated 19 May 2015
Type Journal
Year 2013
Where DLT
Authors Rusins Freivalds
Comments (0)
books