6533b858fe1ef96bd12b6c8f
RESEARCH PRODUCT
Ultrametric Algorithms and Automata
Rūsiņš Freivaldssubject
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_DISCRETEMATHEMATICSdescription
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.
year | journal | country | edition | language |
---|---|---|---|---|
2015-01-01 |