LearnViz CompSci
Home / Learn / Theory & Discrete Math / Church-Turing Thesis

Intermediate Topic 29 of 51 Theory & Discrete Math

Church-Turing Thesis

Claim that Turing machines capture all effective computation.

How it works

The Church-Turing thesis states that any function computable by an effective, step-by-step procedure can be computed by a Turing machine, equivalently by lambda calculus and other formalisms. It is a thesis, not a theorem, because effective procedure is an informal notion that cannot be formally proved equivalent, but all proposed models of computation, including recursive functions, register machines and modern programming languages, have been shown equivalent in power. The stronger, extended version addresses efficiency.

Step-by-step walkthrough

  1. Several different models of computation were proposed.
  2. All turned out to compute exactly the same functions.
  3. The thesis says this captures what effectively computable means.
  4. Real computers compute nothing beyond it.
  5. It cannot be proved because effective is informal.

Where it is used

The thesis justifies using Turing machines to prove limits of computation, supports undecidability results and underlies arguments that any programming language can compute the same functions.

Common pitfall

Treating it as a mathematical theorem is wrong, and hypercomputation proposals challenge it only in theory. Equivalence in power says nothing about speed or resource use. Quantum computers do not violate the basic thesis, although they might challenge the extended one about efficient computation. Use it carefully when arguing something cannot be computed.

Where it fits in the course

Church-Turing Thesis is topic 29 of 51 in Theory & Discrete Math, rated Intermediate. It follows Turing Machines. The next topic is Decidability.

Practice and explore

How to study this topic

  1. Read the explanation above and restate the definition in your own words.
  2. Open the interactive lesson and answer its mini quiz.
  3. Read the common pitfall, then write a short example that avoids it.
  4. Check your understanding in the Theory & Discrete Math quiz, and revisit the topic if you miss a question.

Frequently asked questions

What is Church-Turing Thesis?
Claim that Turing machines capture all effective computation. It belongs to Theory & Discrete Math and is an intermediate-level topic.
Where do people use Church-Turing Thesis?
The thesis justifies using Turing machines to prove limits of computation, supports undecidability results and underlies arguments that any programming language can compute the same functions.
What is the most common mistake with Church-Turing Thesis?
Treating it as a mathematical theorem is wrong, and hypercomputation proposals challenge it only in theory.
What should I learn before this topic?
Start with Turing Machines, the topic just before it in Theory & Discrete Math.
How can I practice it?
Answer the mini quiz in the interactive lesson, then take the Theory & Discrete Math quiz.
Is Church-Turing Thesis hard to learn?
It is an Intermediate topic. Be comfortable with the Beginner topics in this area first, then read the common pitfall carefully, since it is where most mistakes happen.
How long does it take to learn Church-Turing Thesis?
Most learners can read the explanation and finish the interactive lesson in under an hour. Fluency comes from applying the idea, so plan a few short practice sessions with the quiz.
Which topics are related to Church-Turing Thesis?
Turing Machines, Decidability, Chomsky Hierarchy are closely connected. The full list is in the related topics section of this page.
What should I study after Church-Turing Thesis?
Continue with Decidability, the next topic in Theory & Discrete Math.

Related topics