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.

Faculty: Data and Decision Sciences
|Undergraduate Studies
Pre-required courses

94223 - מבני נתונים ואלגוריתמים or 234247 - Algorithms 1

Course with no extra credit (contains)

97447 - Intro. to Computability and Complexity 236343 - Theory of Computation 237343 - Theory of Computation

Semestrial Information

Weekly Hours

2.5 Academic Credit • 2 Lecture Hours • 1 Discussion Hours

No Registration Groups
Weekly Hours

2.5 Academic Credit • 2 Lecture Hours • 1 Discussion Hours

Responsible(s)

דר. קמחי יחיאל

No Registration Groups