Sciweavers

Share
1 search results - page 1 / 1
» dlt 2013
Sort
View
DLT
2013
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 si...
Rusins Freivalds
books