Hey guys,
I'm planning to start a PhD program in statistics next fall, and I'm trying to choose two of the four following classes to take next semester. Which do you think would prepare me better?
Automata, Computability, and Complexity: Circuits and decision trees, finite automata, Turing machines and computability, efficient algorithms and reducibility, the P versus NP problem, NP-completeness, the power of randomness, cryptography and one-way functions, computational learning theory, and quantum computing. Examines the classes of problems that can and cannot be solved in various computational models.
Number Theory: Primes, congruences, quadratic reciprocity, diophantine equations, irrational numbers, continued fractions, partitions.
Introductory Topology: Topological spaces and continuous functions, connectedness, compactness, separation axioms, and selected further topics such as function spaces, embedding theorems, dimension theory, or covering spaces and the fundamental group.
Optimization Methods: Linear programming, network optimization, integer programming, and decision trees. Applications to logistics, manufacturing, transportation, marketing, project management, and finance.
Thanks in advance.