![](https://d3ilqtpdwi981i.cloudfront.net/WCS31ZwteNC6tvVBK7ui3483ae8=/425x550/smart/https://bepress-attached-resources.s3.amazonaws.com/uploads/b1/b9/25/b1b925b9-942d-4e3c-aa21-9aa015f99aca/thumbnail_72ce6f04-3ce7-48fb-9f22-bef8f6cba1ed.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. 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-2005
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" (2005) Available at: http://works.bepress.com/thomas_sudkamp/28/