The exhaustive list of topics in Theoretical Computer Science in which we provide Help with Homework Assignment and Help with Project is as follows:

- Minds and machines
- Complexity
- Logic
- Circuits and finite automata
- Turing machines
- Reducibility and Gödel Polynomial time
- P and NP
- Quantum computing
- NP-completeness
- Space complexity
- Randomness
- Probabilistic complexity classes
- Derandomization / cryptography double feature
- Private-key cryptography
- Public-key cryptography
- Cryptographic protocols
- Interactive proofs / machine learning
- Probably Approximately Correct (PAC) learning
- Chomsky, RSA, Quantum algorithms