Abstract: This talk will serve as an introduction to unsolvability, Turing reducibility, and basic recursion theory. No background in logic or computability is required
Thinking about UNT?
It's easy to apply online. Join us and discover why we're the choice of over 46,000 students.
Apply now