>>11852249>Pure mathematics barely uses any upperclassmen comp. sci. course>he thinks CS is codelmao
> Computer science uses little to none math courses.LMAO
almost every degree worth a shit has multiple electives in mathematics that knock out requirements for both degrees. Graph theory, combinatorics, abstract algebra, cryptography, numerical analysis, linear optimization, mathematical logic, etc..
>It'll take 5-6 years to graduate instead of four. aside from an extra summer, I graduated in 4 years with a double major while taking all honors and grad level classes in my 5th semester and all grad classes from my 6th semester onwards.
>>11852270>I think anon is talking about pure math topics like algebra (so like group theory, galois theory, ring theory etc), topology, real analysis. That's the core of math.Literally all of these are core to CS theory
>group theorythe word problem and computability, algorithms, graph isomorphism problems, coding theory and the Hadamard codes, etc.
>Galois and ring theoryalmost all of modern cryptography, and many results in communication complexity are heavily based on algebraic geometry
>topologytopological data analysis, regression, domain theory, algorithmic knot theory, distributed computability theory, closure operators, concurrency theory, algorithmic game theory, FixP (complexity of fixed points), Borsuk-Ulam and combinatorial topology in particular, etc..
>real analysisrandomized algorithms analysis, BKKKL and harmonic analysis on the boolean cube, approximation theory, applications of Brouwer's constructible measure to randomization, the hypercontractive inequality, bandits and boosting in computational and statistical learning theory, etc.
I don't really care what code monkeys push as CS in undergrad - these are well funded topics in CS that have a bounty of literature out there that all feature and more or less require no less mathematical rigor in pure mathematics than what you've presented as the core.