◀ ▲ ▶Branches / Theoretical-computer-science / Branch: Theoretical Computer Science

Branch: Theoretical Computer Science

Theoretical computer science is a discipline dealing with systematic ways to process information, especially using computers. Key original concepts of theoretical computer science include:

• development of methods for problem-solving theory of algorithms),
• theoretical models to construct computers, i.e. machines able to apply algorithms automata theory),
• a foundation of computability theory itself, i.e. exploring which problems are tractable by applying automata performing algorithms.

Theoretical minimum (in a nutshell)

You should be acquainted with:

• the basic concepts of logic, especially the concepts of language, formal language, syntax, and semantics,
• Syntax and semantics of propositional logic,
• Basic set operations and basics about functions.
• Basics about algebraic structures.

Concepts you will learn in this part of BookofProofs

• What are grammatics of formal languages?
• Learn about and explain the Chomsky hierarchy of language classes_?
• Learn about regular and context-free languages?
• What is computability and learn some not computable problems?
• What is complexity of computation and how to measure it?
• Learn about different complexity classes of problems.

Table of Contents

1. Part: Formal Languages
2. Part: Computability
3. Part: Computational Complexity Theory
4. Part: Optimization Methods
5. Part: Data Structures
6. Part: Basic Algorithms
7. Part: Semi-numerical Algorithms
8. Part: Numerical Algorithms

Mentioned in:

Parts: 1

Thank you to the contributors under CC BY-SA 4.0!

Github: