I007 Computability

Faculty of Informatics
Spring 2002
Extent and Intensity
2/1. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
prof. RNDr. Luboš Brim, CSc. (lecturer)
prof. RNDr. Jan Strejček, Ph.D. (seminar tutor)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Luboš Brim, CSc.
Timetable
Wed 16:00–16:50 B411, Thu 9:00–10:50 D2, Thu 15:00–15:50 B204, Thu 16:00–16:50 B204, Thu 17:00–17:50 B204
Prerequisites (in Czech)
I005 Formal Languages and Automata I && (! I507 Computability )&&(!NOW( I507 Computability ))
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
Syllabus
  • Algorithms, Church's thesis.
  • Syntax and semantics of WHILE-programs, computable functions, computability on words.
  • Standard enumeration of computable functions, enumeration (utm) theorem, parametrization (smn) theorem, effective numberings, Kleene's normal form theorem.
  • Recursive and recursively enumerable sets, enumeration of r.e. sets, closure properties.
  • Examples of undecidable problems, reduction and diagonalization, halting problem, verification problem, equivalence problem.
  • Riece's theorems.
  • Creative and productive sets, m-complete and 1-complete sets, effectively inseparable sets, simple and immune sets.
  • Recursion theorem, applications of the recursion theorem.
  • Alternative approaches to computability, recursive functions.
Literature
  • KOZEN, Dexter C. Automata and computability. New York: Springer, 1997, xiii, 400. ISBN 0387949070. info
  • Theory of Recursive Functions and Effective Computability. Edited by Hartley Rogers. Cambridge: Massachusetts Institute of Technology, 1987, 482 s. ISBN 0262680521. info
  • KFOURY, A. J., Robert N. MOLL and Michael A. ARBIB. A programming approach to computability. New York: Springer-Verlag, 1982, viii, 251. ISBN 0-387-90743-2. info
Language of instruction
Czech
Follow-Up Courses
Further Comments
The course is taught annually.
Teacher's information
http://www.fi.muni.cz/usr/brim/I007
The course is also listed under the following terms Spring 1996, Spring 1997, Spring 1998, Spring 1999, Spring 2000, Spring 2001, Spring 2003.
  • Enrolment Statistics (Spring 2002, recent)
  • Permalink: https://is.muni.cz/course/fi/spring2002/I007