April 2015
Intermediate to advanced
482 pages
11h 42m
English
In this chapter, we discuss Turing machines (TMs) and their applications. Turing, writing before the invention of the modern digital computer, was interested in the question of what it means to be computable? Intuitively, a task is computable if one can specify a sequence of instructions which when followed will result in the completion of the task. Such a set of instructions is called an effective procedure, or algorithm, for the task. This ...
Read now
Unlock full access