The exhaustive list of topics in Theory of Computation in which we provide Help with Homework Assignment and Help with Project is as follows:
- TM Variants, Church-Turing Thesis
- Schur complement method
- Sparse methods
- Decision Problems for Automata and Grammars
- Lincoln Labs view of the cloud; Intro to MapReduce
- Linearly Bounded Automata, PCP
- Nondeterminism, Closure Properties, Regular Expressions ? FA
- LU decomposition
- Finite Automata, Regular Expressions
- Project discussion session
- Parallel prefix
- CF Pumping Lemma, Turing Machines
- Recursion Theorem and Logic
- Undecidability
- Fast multipole method
- Domain decomposition, PDEs
- Fast Fourier Transform (FFT)
- Time Complexity
- Regular Pumping Lemma, Context Free Languages
- MapReduce, graph partitioning
- Parallel programming in Julia
- Ring and hypercube topologies
- Student project presentations
- Pushdown Automata, CFG ? PDA
- P and NP, SAT, Poly-time Reducibility
- NP-Completeness
- Cook-Levin Theorem
- Space Complexity
- PSPACE, TQBF, Savitch's Theorem
- Games, Generalized Geography
- L and NL, NL= coNL
- Hierarchy Theorems
- Provably Intractable Problems, Oracles
- Probabilistic Computation, BPP
- Probabilistic Computation
- Interactive Proof Systems, IP