Ultrametric automata and Turing machines

15 pages•Published: June 22, 2012

Abstract

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.

Keyphrases: models of computation, p adic numbers, probabilistic algorithms

In: Andrei Voronkov (editor). Turing-100. The Alan Turing Centenary, vol 10, pages 98-112.

Links:	https://easychair.org/publications/paper/K3
	https://doi.org/10.29007/tdf5

BibTeX entry

@inproceedings{Turing-100:Ultrametric_automata_Turing_machines,
  author    = {Rusins Freivalds},
  title     = {Ultrametric  automata and Turing machines},
  booktitle = {Turing-100. The Alan Turing Centenary},
  editor    = {Andrei Voronkov},
  series    = {EPiC Series in Computing},
  volume    = {10},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/K3},
  doi       = {10.29007/tdf5},
  pages     = {98-112},
  year      = {2012}}

Download PDF Open PDF in browser