Ultrametric automata and Turing machines

Autor:	Rusins Freivalds
Rok vydání:	2018
Předmět:	Nonlinear Sciences::Cellular Automata and Lattice Gases Computer Science::Formal Languages and Automata Theory
Zdroj:	EPiC Series in Computing.
ISSN:	2398-7340
DOI:	10.29007/tdf5
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::734ee4e8901593b4a89304c1542ec7c8 https://doi.org/10.29007/tdf5 Zobrazit plný text záznamu