![](https://d3ilqtpdwi981i.cloudfront.net/as-AfQDINpGMpvYg26NC_HiWs14=/425x550/smart/https://bepress-attached-resources.s3.amazonaws.com/uploads/4b/5a/69/4b5a699d-3dc8-4bc6-b81d-39cdab6b8f9a/thumbnail_bcc35c43-a99d-43aa-8ff8-76281b43b089.jpg)
Course Syllabus
CS 410/610: Theoretical Foundations of Computing
Computer Science & Engineering Syllabi
Document Type
Syllabus
Description
This course is an introduction to one of the fundamental topics in the theory of computer science: computability theory. Computability theory is concerned with determining whether there is an algorithmic solution to a problem. The study of computability uses the Turing machine as the basic computational model. A Turing machine is a random access, read-write, finite state automaton. Although the Turing machine provides a simple computational framework, the Church-Turing thesis asserts that any problem that can be solved in any algorithmic manner can be solved by a Turing machine.
Publication Date
10-1-2009
College
College of Engineering and Computer Science
Department
Computer Science
Course Number
CS 410/610
Disciplines
Citation Information
Thomas Sudkamp. "CS 410/610: Theoretical Foundations of Computing" (2009) Available at: http://works.bepress.com/thomas_sudkamp/27/