Cs173 -

In CS173, we learned that If you assume a lie, And the logic collapses into absurdity, You have proven the truth. So, I assumed you would stay. I assumed the set of "us" was non-empty. But the logic collapsed. The contradiction was elegant. The proof was sound.

is a foundational course typically required for computer science majors at many universities (most notably at the University of Illinois Urbana-Champaign). The course bridges the gap between calculus-level mathematics and the logical reasoning needed for advanced CS topics like algorithms, data structures, compilers, and theory of computation. In CS173, we learned that If you assume

We learned that some problems are undecidable. That the Turing Machine halts, Or it spins forever, And there is no algorithm to know which. I wrote a program to check if you loved me, But the compiler just returned: Error: Infinite Loop. But the logic collapsed

The course moves away from the continuous mathematics of calculus to focus on "discrete" objects—things that are distinct and countable. is a foundational course typically required for computer

: These form the language of the course, defining how data can be grouped, mapped, and compared.