Skip to main content
Conference Proceedings

Ultrametric finite automata and Turing machines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) 7907 LNCS 1-11
DOI: 10.1007/978-3-642-38771-5_1
6Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Freivalds, R. (2013). Ultrametric finite automata and Turing machines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7907 LNCS, pp. 1–11). https://doi.org/10.1007/978-3-642-38771-5_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free