Course page Home page Home page CoursesNew course

Theory of computation: Computer Science course | Zoonk

28. Theory of computation

Study finite automata, regular languages, context-free grammars, Turing machines, decidability, and computability. This chapter explains the boundary between problems computers can solve, recognize, or never decide in general.

Computer Science

Create this chapter

This chapter is part of the course, but it hasn't been created yet. Create it to see all of its lessons.

Create chapterNBack to courseEsc