课名 Introduction to Computation, CS系的数学课，他们都叫离散数学， 你以前告诉我这门课不应该叫离散数学. 我看大纲这门课有部分离散数学的内容。
谢谢你这位数学教授专业点评！ 请看下面介绍这门课难度是怎样的？大一第一学期学了多重微积分和入门线代之后学这门的。
这是简介：undergraduate core course in discrete mathematics and will deal with logic, elementary number theory, proof by induction, recursion on trees, search algorithms, finite state machines, and a bit of computability.
PART I: Logic and Number Theory
Sets and Strings (1.1, 1.2)
Propositions and Boolean Operations (1.4)
Set Operations and Truth Tables (1.5, 1.6)
Rules for Propositional Proofs (1.7)
What is a Proof? (1.3)
Propositional Proof Strategies (1.8)
Predicates and Relations (1.10, 2.1)
Quantifiers and Languages (2.3, 2.5)
A Murder Mystery (1.9)
Proofs With Quantifiers (2.6)
Relations and Functions (2.8)
Equivalence Relations (2.10)
Practicing Proofs (2.7)
Partial Orders (2.11)
Divisibility and Primes (3.1)
Modular Arithmetic (3.3)
Infinitely Many Primes (3.4)
The Chinese Remainder Theorem (3.5)
The Fundamental Theorem of Arithmetic (3.6)
PART II: Induction, Trees, and Searching
Recursive Definition (4.1)
Proof by Induction for Naturals (4.3)
Variations on Induction for Naturals (4.4)
Proving Basic Facts on Naturals and Strings (4.6, 4.7)
Practicing Induction Proofs (not in book)
Induction for Problem Solving (4.11)
Graphs, Paths, and Trees (4.9, 9.1)
Recursion on Trees (9.3)
More Induction Practice (not in book)
Misconceptions about Induction (not in book)
General, Breadth-First, and Depth-First Search (9.4, 9.5)
BFS and DFS on Graphs (9.6)
Boolean Expression Trees (9.2)
Uniform-Cost and A* Search (9.8, 9.9)
Games and Adversary Search (9.10)
PART III: Regular Expressions, Finite-State Machines, and Computability
Regular Expressions and Their Languages (5.1, 5.2)
Proving Regular Language Identities (5.4)
Proving Properties of the Regular Languages (5.5)
What DFA's Can and Can't Do (14.1, 14.2)
The Myhill-Nerode Theorem (14.3)
NFA's and the Subset Construction (14.5, 14.6)
State Minimization (14.3, adapted)
Killing Lambda-moves: Lambda-NFA's to NFA's (14.7)
Constructing NFA's from Regular Expressions (14.8)
State Elimination: NFA's to Regular Expressions (14.10)
Practicing Some Kleene Constructions (14.9, adapted)
Two-Way Automata and Turing Machines (15.1, 15.6)
Turing Machine Semantics (15.8)
The Halting Problem and Unsolvability (15.10)
Practicing More Kleene Constructions (14.9, adapted)
