Courses – Fakultet tehničkih nauka u Novom Sadu

Subject: Desicion-making theory (17.DOM43Z)

Native organizations units: No data

Type of studies	Title
Doctoral Academic Studies	Mathematics in Engineering (Godina: 2, Winter)

General information:

Category	Scientific-professional
Scientific or art field	Teorijska i primenjena matematika
Interdisciplinary	Yes
ECTS	10

Educational goal:

Gaining fundamental knowledge about computability theory.

Educational outcome:

Knowledge about basic notions and results in computability theory. The ability to apply the methods used in this theory in the research of student`s choice, working with scientists in the country and abroad.

Course content:

Turing machines, partial recursive functions and other computability systems. Church` thesis. Computability. Recursively enumerable sets. Halting problems. Arithmetic hierarchy of (un)computable sets. Abstract State Machines and applications in specification and verification.

Teaching methods:

The presentation of the theoretical part is followed by the corresponding examples which contribute to better understanding of the theoretical part. The students are expected to individually study the additional literature and discuss it with the subject teacher at the consultation classes. Through research and study work the student will, on the bases of scientific journals and other relevant literature that has been studied independently, develop further understanding of the material covered in lectures. Working with the course teacher the student develops the ability to independently work on a scientific paper.

Literature:

Authors	Title	Year	Publisher	Language
Ž. Mijajlović, Z. Marković, K. Došen	Hilbertovi problemi i logika	1986	Zavod za udžbenike i nastavna sredstva	English
Zoran Ognjanović, Nenad Krdžavac	Uvod u teorijsko računarstvo	2005	Fakultet organizacionih nauka, Beograd	Serbian language
N. Cutland	Computability, an introduction to recursive function theory	1986	Cambridge university press	English
H. Lewis	Elements of the theory of computation	1981	Prentice-Hall	English