Get it on Google Play
New! Download Unionpedia on your Android™ device!
Faster access than browser!
New! Don't lose this page! » Create account

E (complexity) and Turing machine

Shortcuts: Differences, Similarities, Jaccard Similarity Coefficient, References.

Difference between E (complexity) and Turing machine

E (complexity) vs. Turing machine

In computational complexity theory, the complexity class E is the set of decision problems that can be solved by a deterministic Turing machine in time 2O(n) and is therefore equal to the complexity class DTIME(2O(n)). A Turing machine is an abstract "machine" that manipulates symbols on a strip of tape according to a table of rules; to be more exact, it is a mathematical model that defines such a device.

Similarities between E (complexity) and Turing machine

E (complexity) and Turing machine have 1 thing in common (in Unionpedia): Computational complexity theory.

Computational complexity theory

Computational complexity theory is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other.

Computational complexity theory and E (complexity) · Computational complexity theory and Turing machine · See more »

The list above answers the following questions

E (complexity) and Turing machine Comparison

E (complexity) has 10 relations, while Turing machine has 140. As they have in common 1, the Jaccard index is 0.67% = 1 / (10 + 140).


This article shows the relationship between E (complexity) and Turing machine. To access each article from which the information was extracted, please visit:

Hey! We are on Facebook now! »