RE (computational complexity theory)

InRE(recursively enumerable), it means 'yes' within a finite time at (Turing machine) It is a set of solutions that can be obtained. Conversely, if the solution is 'no' it is not guaranteed whether the machine will stop.

REis also a class of decision problem that can list problems such as solutions 'yes' using Turing machines. For this reason It is called 'enumerable' (enumerable).

We call Co-REa class with similar properties when the solution is 'no'.

Each element of REis (recursively enumerable set).

Relationship with other classes

REis known to be strictly larger than*and it is known that it is not strictly equal to Co -*RE. These have the following relationship.

\ {Textbf {R}} = {\ textbf {RE}} \ cap {\ textbf {Co - RE}}}! {{\ Displaystyle {\ textbf {R} } = {\ \ textbf {RE}} \ cap {\ textbf {Co - RE}}}] (https://wikimedia.org/api/rest_v1/media/math/render/svg/11045d27f5ee9eb0322b561c964cadad99c17203)

External link

*.

This item is related to****. I will do (/). — | —

Acquired from ""

Post Date : 2018-02-07 23:00

This article is taken from the Japanese Wikipedia RE (computational 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, This site 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.