The exhaustive list of topics in Automata, Computability and Complexity in which we provide Help with Homework Assignment and Help with Project is as follows:
- Cache design issues
- Self-reference and the recursion theorem
- Quantum mechanics and BQP
- PAC learning
- NFAs and regular expressions
- Turing machines
- Non-regular languages and the pumping lemma
- Trapdoor one-way functions and zero-knowledge proofs
- Deterministic finite automata (DFAs) and nondeterministic finite automata (NFAs)
- Stacks and procedures
- NP-completeness
- Mapping reducibility and Rice's theorem
- Public-key cryptography
- Virtual machines: timesharing, OS kernels, supervisor calls
- Undecidable problems and Post correspondence problem (PCP)
- Complexity theory
- Decidability
- Quantum algorithms
- CMOS technology, gate design, timing
- Probabilistic Turing machines and complexity classes
- Logic, circuits, and gates
- Cryptography
- Complexity theory
- Storage elements, finite state machines
- Probably approximately correct (PAC) learning
- Pseudorandom generators and one-way functions
- Procedures, Processes, and Recursion