Subject: Subject Sylbus: Intro. to Computability and Complexity - 097447 (Current)

Intro. to Computability and Complexity - 097447
Will be learned this year
Credit
Points
2.5
Lecture Exercise Laboratory Project or
Seminar
House
Work
Weekly
Hours
2 1 2

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


Prerequisites: Data Structures and Algorithms 094224
or Algorithms 1 234247
Overlapping Courses: Theory of Computation 236343
Incorporated Courses: Introduction to Computability 094250


The Course Provides An Introduction to Computatbility and Complexity, Including: Deterministic Automaton and Regular Languages, Nondeterministic Automaton, Context-Free Languages and Push-Down Automaton, Algorithms on Automata, Turing Machine, and Decidability. in Complexity Theory the Course Covers the Classes P, Np, Np-Hard, Np-Complete, and Pspace. at the End of the Course the Students
1. Will Know Fundamental Concepts in Computability, Including Automata Theory, Turing Machines, Regular Languages and Decidability.
2. Will Know Fundamental Concepts in Complexity Theory, Including the Major Complexity Classes of P, Np, Np-C and Pspace.
3. Will Know How to Prove Membership of a Problem in a Complexity Class, and How to Prove That a Problem Is Decidable Or Undecidable.
4. Will Be Familiar with the Argument of Why the Number of Decidable Problems Is Countable, Whereas the Number of Undecidable Problems Is Uncountable.




Times and places of examinations 02/2020 2020/2021 Spring Semester
examination timedaydateSeason
Tuesday27.07.2021
Friday22.10.2021

Timetable to semester 02/2020 2020/2021 Spring Semester
RoomBuildingHourdayLecturerExercise
Lecture
no.Registering
Group
213Ullman12:30-14:30ThursdayFull Professor Strichman OferLecture1011
804Ullman14:30-15:30ThursdayMr. Exercise11
213Ullman12:30-14:30ThursdayFull Professor Strichman OferLecture1012
11:30-12:30SundayMr. Hess Green RazielExercise12
213Ullman12:30-14:30ThursdayFull Professor Strichman OferLecture1013
801Ullman15:30-16:30ThursdayMr. Exercise13


Textbooks
PublishedPublisherAuthorsBook
1998prentice-hallh.r. lewis, and c.h. papadimitriouelements of the theory of computation (2nd ed.)
2013cengage learningmichael sipserintroduction to the theory of computation, 3rd edition

Created in 08/03/2021 Time 15:00:56