Abstract
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.
| Original language | American English |
|---|---|
| State | Published - Oct 1 2004 |
Disciplines
- Computer Engineering
- Computer Sciences
- Engineering
- Physical Sciences and Mathematics