Sie sind auf Seite 1von 2

COURSE DESCRIPTION

Dept.,Number Semester Hours Current Catalog Description

CCOM5035 3

Course Title Course Coordinator

Computability Theory

This course discusses fundamental concepts, ideas, and models of the theory of computation. A basic introduction to automata theory and languages is presented as well as an introduction to some aspects of the theory of computability such as Turing machines and decidability are presented. Also concepts of complexity theory such as NP-completeness are given. Textbook Michael Sipser, Introduction to the Theory of Computation (2nd edition), PWS Publishing Company (2005) References John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman, Introduction to Automata Theory, Languages, and Computation, second edition, AddisonWesley (2003). Daniel I.A. Cohen: Introduction to Computer Theory (2nd edition) (1997) http://infolab.stanford.edu/~ullman/ialcsols/sols.html Course Outcomes Understand the fundamental concepts of the theory of computability. Understand and utilize the basic concepts of automata theory and languages to explain the fundamental concepts of the theory of computability. Understand the relation among the theory of computation and complexity theory. understand that there are real problems that cannot be solved by today's computers study the contributions of diverse groups to computer science Relationship between Course Outcomes and Program Outcomes Intellectual curiosity and capacity for independent study is related to Understand the fundamental concepts of the theory of computability. Creative and analytic ability, and capacity for logical reasoning is related to Understand and utilize the basic concepts of automata theory and languages to explain the fundamental concepts of the theory of computability. Effective use of mathematical language and ability to develop elementary proofs. is related to Understand and utilize the basic concepts of automata theory and languages to explain the fundamental concepts of the theory of computability. Ability to identify, organize, evaluate, and use information. is related to Understand and utilize the basic concepts of automata theory and languages to explain the fundamental concepts of the theory of computability. Ability to effectively communicate (orally and in writing) in Spanish and English. is related to Understand and utilize the basic concepts of automata theory and languages to explain the fundamental concepts of

the theory of computability. Understanding of the limitations of computing, in particular, the difference between what inherently cannot be computed versus what can be achieved through advances in science and technology. is related to Understand the relation among the theory of computation and complexity theory. Prerequisites by Topic Major Topics Covered in the Course Mathematical preliminaries Automata theory Formal languages Turing machines Decidability Reducibility Complexity theory Assessment Plan for the Course Understand the fundamental concepts of the theory of computability. will be evaluated with Problems in Exam Understand and utilize the basic concepts of automata theory and languages to explain the fundamental concepts of the theory of computability. will be evaluated with Problems in Exam Understand the relation among the theory of computation and complexity theory. will be evaluated with Problems in Exam understand that there are real problems that cannot be solved by today's computers will be evaluated with Problems in Final Exam How Data in the Course is Used to Assess Program Outcomes (unless adequately covered already in the assessment discussion under Criterion 4) ''Understanding of the limitations of computing, in particular, the difference between what inherently cannot be computed versus what can be achieved through advances in science and technology.'' will be evaluated with ''Problems in Exam'' throught ''Understand the relation among the theory of computation and complexity theory.'' Estimate Curriculum Category Content (Semester hours) Area Algorithms Data Structures Computer organization and architecture Core 1.33 0.33 0.33 Advanced 1.00 0.00 0.00 Area Software Design Concepts of programming languages Other Core 0.00 0.00 0.00 Advanced 0.00 0.00 0.00

Das könnte Ihnen auch gefallen