6533b858fe1ef96bd12b6c8f

RESEARCH PRODUCT

Ultrametric Algorithms and Automata

Rūsiņš Freivalds

subject

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESTheoretical computer scienceFinite-state machineComputer scienceComputationStochastic matrixNonlinear Sciences::Cellular Automata and Lattice GasesAutomatonTuring machinesymbols.namesakeTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESProbabilistic automatonsymbolsAutomata theoryUltrametric spaceComputer Science::Formal Languages and Automata TheoryMathematicsofComputing_DISCRETEMATHEMATICS

description

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.

https://doi.org/10.1007/978-3-319-21819-9_2