Theory of Computability and Complexity

  • Computer Science |
  • English

Description

This course covers the theoretical computer science areas of computability and complexity. The course starts by introducing the formal languages and their related theories. Then, it covers topics in computability which includes Turing machines and their variants, halting problem, decidable and undecidable problems, and reducibility. Complexity Theory covers the topics of time and space measures, complexity classes P, NP, L, NL, PSPACE, BPP and IP, complete problems, P versus NP conjecture, quantifiers and games, provably hard problems, relativized computation and oracles, probabilistic computation, and interactive proof systems.

Program

Master of Computing in Computer Science

Objectives

  • Data will be available soon!

Textbook

Data will be available soon!

Course Content

content serial Description

Markets and Career

  • Generation, transmission, distribution and utilization of electrical power for public and private sectors to secure both continuous and emergency demands.
  • Electrical power feeding for civil and military marine and aviation utilities.
  • Electrical works in construction engineering.
Courses
  • Degree Master
  • Code: CS705
  • Credit hrs: 3
  • Prequisites: none
Download.pdf
Apply Now

Start your application

Start The your journey to your new career.
SUBMIT IT NOW