<p>In general CS has less math than ECE. CS also needs some discrete math like this one at UB:</p>
<p>CSE 191 Discrete Structures
Credits: 4
Semester(s): F Sp
Prerequisites: CSE 113 or CSE 115 or knowledge of introductory computer science/computer programming
Corequisites: None
Type: LEC/REC</p>
<p>View Schedule
Foundational material for further studies in computer science. Topics include logic, proofs, sets, functions, relations, recursion, recurrence relations, mathematical induction, graphs, trees, and some basic counting theory. CSE 191 is required for computer science and computer engineering majors</p>
<p>And this one (very abstract):
CSE 396 Introduction to the Theory of Computation
Credits: 4
Semester(s): F
Prerequisites: CSE 250
Corequisites: None
Type: LEC/REC</p>
<p>View Schedule
Covers machine models and formal specifications of the classes of computational problems they can solve. The central concepts are the Turing machine and the classes of decidable and computably enumerable languages. The Halting Problem and other natural problems are shown to be undecidable by Turing machines, implying that they are undecidable by high-level programming languages or any other known computational model. Finite automata, which are Turing machines without external memory, are shown to correspond to the class of regular languages. The course also covers regular expressions, time and space complexity of Turing machines, reducibility between problems, and NP-completeness.</p>