prikaz prve stranice dokumenta Algoritamski nerješivi masovni algoritamski problemi
  Download
PDF 446.9 KB
undergraduate thesis
Algoritamski nerješivi masovni algoritamski problemi
2018. urn:nbn:hr:211:623828
Ilona, Benko
University of Zagreb
Faculty of Organization and Informatics
Department of Theoretical and Applied Foundations of Information Sciences

Cite this document

Ilona, B. (2018). Algoritamski nerješivi masovni algoritamski problemi (Undergraduate thesis). Varaždin: University of Zagreb, Faculty of Organization and Informatics. Retrieved from https://urn.nsk.hr/urn:nbn:hr:211:623828

Ilona, Benko. "Algoritamski nerješivi masovni algoritamski problemi." Undergraduate thesis, University of Zagreb, Faculty of Organization and Informatics, 2018. https://urn.nsk.hr/urn:nbn:hr:211:623828

Ilona, Benko. "Algoritamski nerješivi masovni algoritamski problemi." Undergraduate thesis, University of Zagreb, Faculty of Organization and Informatics, 2018. https://urn.nsk.hr/urn:nbn:hr:211:623828

Ilona, B. (2018). 'Algoritamski nerješivi masovni algoritamski problemi', Undergraduate thesis, University of Zagreb, Faculty of Organization and Informatics, accessed 02 October 2023, https://urn.nsk.hr/urn:nbn:hr:211:623828

Ilona B. Algoritamski nerješivi masovni algoritamski problemi [Undergraduate thesis]. Varaždin: University of Zagreb, Faculty of Organization and Informatics; 2018 [cited 2023 October 02] Available at: https://urn.nsk.hr/urn:nbn:hr:211:623828

B. Ilona, "Algoritamski nerješivi masovni algoritamski problemi", Undergraduate thesis, University of Zagreb, Faculty of Organization and Informatics, Varaždin, 2018. Available at: https://urn.nsk.hr/urn:nbn:hr:211:623828

Please login to the repository to save this object to your list.
Metadata
TitleAlgoritamski nerješivi masovni algoritamski problemi
Title (english)Algorithmically unsolvable mass algorithmic problems
AuthorBenko Ilona
MentorMirko Čubrilo (mentor)
MBZ: 135963
Committee memberAlen Lovrenčić
MBZ: 218662
GranterUniversity of Zagreb
Faculty of Organization and Informatics
(Department of Theoretical and Applied Foundations of Information Sciences)
Varaždin
Defense date and country2018-08-27, Croatia
Scientific / art field,
discipline and subdiscipline		SOCIAL SCIENCES
Information and Communication Sciences
Organization and Informatics
Abstract
Pojam „algoritam“ je suštinski intuitivan. Prilikom opisivanja istog, formalizacija se čini kao korektnija opcija zbog nepreciznosti i problema s interpretacijom govornog jezika. To je učinjeno pomoću Turingovog stoja, koji se ističe kao jedno od pogodnih rješenja imajući u vidu glavna svojstva i zahtjeve koje svaki algoritam mora zadovoljavati. Nadalje, opisan je pojam izračunjivosti po Turingu, pojam univerzalnog Turingovog stroja, te problem zaustavljanja Turingovog stroja. U tom kontekstu, formulirana je metoda dokazivanja algoritamske nerješivosti masovnih algoritamskih problema metodom svodivosti njihove rješivosti na nerješive masovne algoritamske probleme. Metoda je izložena i primijenjena nad nekoliko primjera dokazivanja nerješivosti nerješivih masovnih algoritamskih problema.
Keywords
Languagecroatian
URN:NBNurn:nbn:hr:211:623828
Study programmeTitle: Information Systems
Study programme type: university
Study level: undergraduate
Academic / professional title: sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) informatike (sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) informatike)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0) icon
Created on2020-04-27 08:09:05