I would definitely recommend learning basics of algorithms, feasibility (P vs NP), or even computability (halting problem, Godel’s incompleteness, etc).
They will change your worldview significantly.
CLRS is a good entry point. After that, perhaps Sipser for some more depth.
Seconded. P versus NP is the most important piece of the basic math of computer science, and a basic notion of algorithms is a bonus. The related broader theory which nonetheless still counts as basic math is algorithmic complexity and the notion of computability.
I would definitely recommend learning basics of algorithms, feasibility (P vs NP), or even computability (halting problem, Godel’s incompleteness, etc). They will change your worldview significantly.
CLRS is a good entry point. After that, perhaps Sipser for some more depth.
Seconded. P versus NP is the most important piece of the basic math of computer science, and a basic notion of algorithms is a bonus. The related broader theory which nonetheless still counts as basic math is algorithmic complexity and the notion of computability.