Lesson plan

Computation tree

In computability theory, a computation tree is a representation for the computation steps of a non-deterministic Turing machine on a specified input. A computation tree is a rooted tree of nodes and edges. Each node in the tree represents a single computational state, while each edge represents a transition to the next possible computation. The number of nodes of the tree is the size of the tree and the length of the path from the root to a given node is the depth of the node. The largest depth of an output node is the depth of the tree. The leaves of the tree are called output nodes. In a computation tree for a decision problem, each output node is labeled Yes or No. If a tree, T, with an input space X, if x \in X and the path for x ends in node labeled yes, then the input x is accepted. Else it is rejected. The depth of the computation tree for a given input is the computation time for the Turing machine on that input Computation trees have also been used to study the computational complexity of problems in computational geometry and real number calculations.

Back to article

Article summary

In computability theory, a computation tree is a representation for the computation steps of a non-deterministic Turing machine on a specified input. A computation tree is a rooted tree of nodes and edges. Each node in the tree represents a single computational state, while each edge represents a transition to the next possible computation. The number of nodes of the tree is the size of the tree and the length of the path from the root to a given node is the depth of the node. The largest depth of an output node is the depth of the tree. The leaves of the tree are called output nodes. In a computation tree for a decision problem, each output node is labeled Yes or No. If a tree, T, with an input space X, if x \in X and the path for x ends in node labeled yes, then the input x is accepted. Else it is rejected. The depth of the computation tree for a given input is the computation time for the Turing machine on that input Computation trees have also been used to study the computational complexity of problems in computational geometry and real number calculations.

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.