Recursively enumerable set
A recursively enumerable set (also semi-decidable set , positive semi-decidable set , semi-decidable set , computable enumerable set , re , ce for short ) is a set of natural numbers in computability theory , if there is an algorithm that does the Enumerates elements of this set. This characterization is equivalent: There is an algorithm which outputs 1 whenever the input is an element of the relevant set and never stops on other inputs. Every decidable set is recursively enumerable, but there are recursively enumerable sets that are not decidable.
The term “ calculable set ” occasionally appears in the literature . This term is used inconsistently. It can mean decidable sets or recursively enumerable sets.
Formally, recursively enumerable sets are usually characterized by one of the following definitions that are equivalent to one another:
- Recursive enumerability
The set is called semi-decidable if the partial characteristic function of is computable.
Equivalences to the definition
The following sentences are equivalent to one another:
- is recursively enumerable.
- is semi-decidable.
- is of the Chomsky type 0 .
- is the set of all calculation results of a Turing machine .
- is the domain of a computable function.
- is the image set of a computable function.
- is finite or the range of values of an injective computable function.
- is the image set of a primitive recursive function or the empty set.
- is in the class of the arithmetic hierarchy .
- many-one can be reduced to the holding problem .
- There is a decidable amount which: .
- Every decidable set is recursively enumerable, but there are recursively enumerable sets that are not decidable.
- A set is decidable if and only if it and its complement can be enumerated recursively.
- Every finite set can be enumerated recursively.
- Every recursively enumerable set is enumerable , but not all enumerable sets are recursively enumerable.
- Every infinite recursively enumerable set has subsets that are not recursively enumerable.
- The intersection of finitely many recursively enumerable sets is recursively enumerable; the union of a recursively enumerable set of recursively enumerable sets is recursively enumerable. There are recursively enumerable sets whose complement is not recursively enumerable.
- A partial function is computable if and only if its graph can be enumerated recursively.
- The set of pairs of the form: (program, input) with the property: the program stops with the input is recursively enumerable. This set is also called "Universal Language". The stopping problem of the Turing machines is thus semi-decidable, because the given Turing machine can be run with the given input and output 1 after it has been terminated . The complement of the holding problem is not semi-decidable.
- The self-applicability can be enumerated recursively: In the above example we limit ourselves to the inputs that correspond to the respective program.
- The equivalence problem of the Turing machines is not semi-decidable. The complement of the equivalence problem is also not semi-decidable.
- The values of the busy beaver function cannot be recursively enumerated.
- Hartley Rogers: Theory of recursive functions and effective computability . McGraw-Hill, 1967.