computer science

Basic idea

The study of computation: what can be computed, how efficiently, and with which abstractions. Spans theory (complexity, computability), systems (OS, distributed), languages, data structures, and AI.

Key formulas

• Big-O: $f(n) = O(g(n)) \iff \exists c, n_0.\ \forall n \ge n_0.\ f(n) \le c\, g(n)$
• Master theorem: $T(n) = a T(n/b) + f(n)$
• Shannon entropy: $H(X) = -\sum_i p_i \log p_i$
• Church-Turing thesis: computable = Turing-computable

Pages

• ai
• compression
• computer algebra
• data structures
• distributed systems
• formal verification
• Operating Systems
• programming language theory
• search
• theoretical

Siblings

• math
• philosophy
• physics
• software engineering