Ultrametriski algoritmi
Loading...
Date
Authors
Advisor
Journal Title
Journal ISSN
Volume Title
Publisher
Latvijas Universitāte
Language
N/A
Abstract
Maģistra darbā tiek pētīta ultrametriska galīga automāta un ultrametriska vaicājošā algoritma definīcija, kas paredz p-adisku skaitļu izmantošanu amplitūdu norādīšanā. Lasītājs tiek iepazīstināts ar p-adisku skaitļošanas sistēmu un absolūtās vērtības jēdzienu. Darba ietvaros tiek izstrādātas ultrametrisku automātu realizācijas dažādu valodu atpazīšanai. Ultrametrisku automātu rēķināšanas sarežģītība tiek novērtēta pēc stāvokļu skaita automātā. Tiek apskatīts ultrametrisks vaicājošais algoritms, kas pārbauda Heminga koda pareizību. Darbā tiek pētītas ultrametrisku algoritmu priekšrocības salīdzinot ar klasiskām un kvantu skaitļošanas teorijas pamatkoncepcijām.
This master thesis explores the definition of ultrametric finite automaton and ultrametric query algorithms which anticipates the use of p-adic numbers as amplitudes. The reader is introduced to the definition of p-adic numeric system and absolute value. The realizations of ultrametric automata for recognition of various languages were developed in this work. Algorithm computational complexity was rated by number of states in automaton. The work explores an ultrametric query algorithm which verifies the correctness of the Hamming code. The work investigates advantages of ultrametric algorithms in comparison to their classical and quantum basic concepts of computational theory.
This master thesis explores the definition of ultrametric finite automaton and ultrametric query algorithms which anticipates the use of p-adic numbers as amplitudes. The reader is introduced to the definition of p-adic numeric system and absolute value. The realizations of ultrametric automata for recognition of various languages were developed in this work. Algorithm computational complexity was rated by number of states in automaton. The work explores an ultrametric query algorithm which verifies the correctness of the Hamming code. The work investigates advantages of ultrametric algorithms in comparison to their classical and quantum basic concepts of computational theory.