Difference between revisions of "CoE 161"
Jump to navigation
Jump to search
(Created page with "* Introduction to Information and Complexity ** Advanced course on information theory and computational complexity, starting from Shannon's information theory and Turing's the...") |
|||
Line 1: | Line 1: | ||
− | * Introduction to Information and Complexity | + | * Introduction to Information and Complexity (2018 Curriculum) |
− | ** Advanced course on information theory and computational complexity, starting from Shannon's information theory and Turing's theory of computation, leading to the theory of Kolmogorov complexity. | + | ** Advanced course on information theory and computational complexity, starting from Shannon's information theory and Turing's theory of computation, leading to the theory of Kolmogorov complexity. |
− | * Credit: 3 units ( | + | |
+ | * Semester Offered: 2nd semester | ||
+ | * Course Credit: Lecture: 3 units | ||
+ | |||
+ | == Prerequisites == | ||
+ | * EEE 111 (Introduction to Programming and Computation) | ||
+ | * EEE 137 (Probability, Statistics and Random Processes in Electrical and Electronics Engineering) | ||
+ | |||
+ | == Course Goal == | ||
+ | * Introduce fundamental tools and frameworks to understand information and complexity in the design of computer systems. | ||
+ | |||
+ | === Specific Goals === | ||
+ | * Introduce fundamental tools for determining the minimum amount of computational resources needed to algorithmically solve a problem. | ||
+ | ** Information Theory | ||
+ | ** Computational Complexity Theory |
Revision as of 10:44, 24 June 2020
- Introduction to Information and Complexity (2018 Curriculum)
- Advanced course on information theory and computational complexity, starting from Shannon's information theory and Turing's theory of computation, leading to the theory of Kolmogorov complexity.
- Semester Offered: 2nd semester
- Course Credit: Lecture: 3 units
Prerequisites
- EEE 111 (Introduction to Programming and Computation)
- EEE 137 (Probability, Statistics and Random Processes in Electrical and Electronics Engineering)
Course Goal
- Introduce fundamental tools and frameworks to understand information and complexity in the design of computer systems.
Specific Goals
- Introduce fundamental tools for determining the minimum amount of computational resources needed to algorithmically solve a problem.
- Information Theory
- Computational Complexity Theory