Turing Completeness

Relevance to programming languages: How can we measure the generality of a language?

(One answer: by determining whether or not the language is “Turing complete.”)

Historical perspective.

Examples of Turing Machines.

Formal definition of Turing Machines.

Formal definition of Turing Completeness.

Applying Turing Completeness.

Next slide

Back to first slide

View graphic version