CS701-Theory of Computation
This is the first pure course in theoretical computer science. It discusses some of the fundamental questions about computation. It starts with an overview of the concepts in theory of automata. Then discusses computability theory in detail. After developing concepts in computability theory the course moves forward to complexity theory. Complexity theory is subdivided into time and space complexity. The course first discusses time complexity and after that space complexity is covered in detail.
Course Learning Outcomes
At the completion of the course, you should be able to answer the following questions:
▪ What is computation?
▪ Is there a universal model of computation?
▪ Can everything be computed?
▪ Can we identify problems that are not computable?
▪ What resources are needed to perform a certain computation?
▪ Can we identify computationally hard problems?
Note: This application doesn't require any credentials to use and neither it ask for any username/password. Its a free application that provides a support for students to access their lectures, slides and handouts without the need to login to the VLMS every time. This is a non-profit app and will always be. Thats why its FREE!!!
* Improvements and Bug Fixes
- Muhammad Usman Ghani
- 29.7 MB
Erfordert iOS 8.0 oder neuer. Kompatibel mit iPhone, iPad und iPod touch. Apple TV.
- © Muffin'sLabs 2017
Wenn die Familienfreigabe aktiviert ist, können bis zu sechs Familienmitglieder diese App verwenden.