Undecidable problems in the theory of computation

V magistrskem delu je predstavljena hierarhija avtomatov in pripadajočih jezikov. Vpeljani so pojmi, povezani z razpoznavnimi in nerazpoznavnimi jeziki. Sledi nadaljnja vpeljava podrazreda razpoznavnih jezikovto so odločljivi jeziki. S pomočjo odločljivih oziroma neodločljivih jezikov prevedemo in strogo definiramo koncept odločljivih oziroma neodločljivih problemov. Podrobno so opisani so naslednji zgledi neodločljivih problemov: problem zaustavitve Turingovega stroja, Postov korespodenčni problem, problem zaposlenega bobra in Hilbertov deseti problem. V okviru magistrskega dela je bila izdelana spletna aplikacija, ki išče konkretne rešitve Postovega korespodenčnega problema. Podrobno je opisano programsko orodje z razlago programske kode in navodili za uporabo. Naveden je tudi primer uporabe spletne aplikacije v praksi, na primer pri računalniškem krožku.In this master thesis the hierarchy of automata and related languages is presented. First, the concepts, associated with recognizable and unrecognizable languages are introduced, followed by further introduction of a subclass of recognized languagesthese are decidable languages. By means of decidable and undecidable languages the concept of decidable and undecidable problems was translated and strictly defined. The following examples of undecidable problems are described in detail: the Turing\u27s halting problem, the Post correspondence problem, the busy beaver problem and the Hilbert\u27s tenth problem. In the frame of the master thesis, a web application which is searching for concrete solutions of the Post correspondence problem, was developed. The programming environment of the application and the interpretation of the source code with instructions for its using are described in detail. An example for the usage of the application at teaching, for example in a computer club, is presented