inflearn logo

Theory of Computation

This course focuses on computability and computational complexity theory. Learners will cover topics such as regular languages, context-free languages, decidable and undecidable problems, and recursive function theory.

6 learners are taking this course

Level Beginner

Course period Unlimited

discrete
discrete
computation
computation
theory
theory
mathematics
mathematics
MIT
MIT
discrete
discrete
computation
computation
theory
theory
mathematics
mathematics
MIT
MIT
Thumbnail

What you will gain after the course

  • The ability to distinguish between regular languages and context-free languages

  • Ability to understand decidability and undecidable problems

  • Ability to explain the basic concepts of complexity theory

Recommended for
these people

Who is this course right for?

  • Someone struggling because they cannot solve complex algorithm problems

  • Someone who lacks basic knowledge of the theory of computation

  • Someone who does not understand the difference between context-free languages and regular languages

Need to know before starting?

  • Basic knowledge of discrete mathematics

  • Understanding of algorithms and data structures

  • Basic programming experience

Hello
This is Open Academy

1,856

Learners

10

Reviews

4.8

Rating

116

Courses

"So that language does not become a barrier to learning."

We deliver open lectures from the world's leading institutions.
Through translation and subtitling, we help all learners follow the lectures without the burden of the original language.

More

Curriculum

All

28 lectures ∙ (32hr 18min)

Course Materials:

Lecture resources
Published: 
Last updated: 

Reviews

Not enough reviews.
Please write a valuable review that helps everyone!

Open Academy's other courses

Check out other courses by the instructor!

Similar courses

Explore other courses in the same field!

Free