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.

• Type: Journal
• Year: 2013
• Where: DLT
• Authors: Rusins Freivalds
• Keywords: DLT 2013, Theoretical Computer Science