hidden - assigned and confirmed by the Study Dept.
Date of registration:
05.11.2009
Date of assignment:
05.11.2009
Date and time of defence:
25.06.2010 00:00
Date of electronic submission:
25.06.2010
Date of proceeded defence:
25.06.2010
Opponents:
Mgr. et Mgr. Emil Jeřábek, Dr., Ph.D.
Guidelines
Nastudovat a presentovat konstrukce universálního Turingova stroje
a případně navrhnout vlastni konstrukci.
References
M. R. Garey, D. S. Johnson,
Computers and Intractability: A Guide to the Theory of NP-Completeness, FReeman, 1979.
Turing, A.M. (1936), "On Computable Numbers, with an Application to the Entscheidungsproblem", Proceedings of the London Mathematical Society, 2 42: 230?65, 1937, doi:10.1112/plms/s2-42.1.230, http://www.comlab.ox.ac.uk/activities/ieg/e-library/sources/tp2-ie.pdf (and Turing, A.M. (1938), "On Computable Numbers, with an Application to the Entscheidungsproblem: A correction", Proceedings of the London Mathematical Society, 2 43: 544?6, 1937, doi:10.1112/plms/s2-43.6.544 )