RE (calculation complexity theory)

In a calculation complexity theory, complexity class RE (recursively enumerable) is the set of the decision problem that a solution called 'yes' is got from with Turing machine (Turing machine) before limited time. On the contrary, it is not guaranteed whether a machine stops when a solution is 'no'.

RE is a class of the decision problems that can list the problems that a solution is 'yes' using Turing machine again. Therefore, I am called 'enumerable' (I can list it).

I call the class where a solution becomes similar property in the case of 'no' Co-RE.

Each element of RE is an inductive countable set (recursively enumerable set).

with other classes of relationships

It is known that RE is bigger closely than R and is not known to be equal to Co-RE closely. I have following relation to these.

${\displaystyle {\textbf {R}}={\textbf {RE}}\cap {\textbf {Co-RE}}}$ 

Outside link

• Complexity Zoo: Class RE.

This item is an unfinished item in conjunction with the computers. I demand the cooperator who corrects it, and corrects this item (PJ: computer /P: computer).

It is acquired by "https://ja.wikipedia.org/w/index.php?title=RE_ (calculation complexity theory) &oldid=52465231"

This article is taken from the Japanese Wikipedia RE (calculation complexity theory)

This article is distributed by cc-by-sa or GFDL license in accordance with the provisions of Wikipedia.

Wikipedia and Tranpedia does not guarantee the accuracy of this document. See our disclaimer for more information.

In addition, Tranpedia is simply not responsible for any show is only by translating the writings of foreign licenses that are compatible with CC-BY-SA license information.