Introduction to Computability  094250
Will not be given the year



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, ContextFree Languages and PushDown Automaton, Algorithms on Automata, Turing Machine, Computability. in Complexity Theory: the Classes P, Pn, Pspace, Complete Classes. Propositional Logic, FirstOder Logic, and Temporal Logic as Modeling Languages.
TextbooksPublished  Publisher  Authors  Book 

1998  prenticehall  h.r. lewis and c.h. papadimitriou  elements of the theory of computation 2nd ed. 
Created in 08/12/2022 Time 10:39:34