Im pretty sure that Topics include proof techniques and logic; induction; sets, functions, and relations; etc. is a requirement to understanding Turing Machine

Im pretty sure that Topics include proof techniques and logic; induction; sets, functions, and relations; etc. is a requirement to understanding Turing Machines, and NP-Completeness. That they probably forgot all of it immediately after the final is probably indicative that they're interested in a career in software engineering not research