| Educational guide School of Engineering |
english |
| Engineering in Computer Systems (1998) |
 Subjects |
| ABSTRACT MODELS OF CALCULUS |
| Contents |
| IDENTIFYING DATA | 2011_12 |
| Subject | ABSTRACT MODELS OF CALCULUS | Code | 17081006 | |||||
| Study programme |
|
Cycle | 1st | |||||
| Descriptors | Credits | Theory credits | Practical credits | Type | Year | Period | ||
| 4.5 | 3 | 1.5 | Core | Second | Second |
|||
| Contents | Personalized attention | Assessment |
| Sources of information | ||
| Topic | Sub-topic |
| Introduction | Motivation and Objectives of this subject Chomsky's hierarchy |
| Turing Machine | Description and Representations TM to recognize Formal Languages TM to compute Mathematical Functions The TM Execution Cycle Deterministic TM Non-Deterministic TM The Universal TM |
| An Introduction to the Theory of Calculability | Some Limitations of TM Calculability Principles The Theory of Calculability |
| An Introduction to the Theory of Complexity | Computational Complexity Basic Complexity Classes The Classes L and NL The Classes P, NP i CoNP The Classes EXP i NEXP Complexity Principles The Theory of Complexity |
