Turing Completeness

A programming language L is said to be Turing complete provided that any function that can be computed by some Turing machine can also be computed by some program expressed in L.

Previous slide

Next slide

Back to first slide

View graphic version