Subject: Subject Sylbus: Introduction to Computability - 094250

Introduction to Computability - 094250
Will not be given the year
Credit
Points
2.5
 
  Lecture Exercise Laboratory Project or
Seminar
House
Work
Weekly
Hours
2 1      

Determination of the grade according to progress during the semester and a final examination.


Prerequisites Data Structures and Algorithms 094223
or Algorithms 1 234247
 
Incorporating Courses Theory of Computation 236343
Theory of Computation 237343
Intro. to Computability and Complexity 097447


The Course Provides An Introduction to Computability and Complexity, with Some Logic, Including: Deterministic Automaton and Regular Languages, Nondeterministic Automaton, Context-Free Languages and Push-Down Automaton, Algorithms on Automata, Turing Machine, Computability. in Complexity Theory: the Classes P, Pn, Pspace, Complete Classes. Propositional Logic, First-Oder Logic, and Temporal Logic as Modeling Languages.




Textbooks
PublishedPublisherAuthorsBook
1998prentice-hallh.r. lewis and c.h. papadimitriouelements of the theory of computation 2nd ed.

Created in 08/12/2022 Time 10:39:34