|
Feb 10, 2025
|
|
|
|
CS 450 - Computability (4) Abstract models of computation, including Turing machines. Church- Turing thesis. Decidability. Theoretical and practical capabilities and limitations of computing machines.
Prerequisite(s): CS 311 with a grade of C or better, or consent of instructor. Component(s): 4 lectures/problem-solving.
Add to Portfolio (opens a new window)
|
|