recursively enumerable
For a language , TFAE:
- •
There exists a Turing machine
such that .
- •
There exists a total recursive function which is onto.
- •
There exists a total recursive function which is one-to-one and onto.
A language fulfilling any (and therefore all) of the above conditions is called recursively enumerable.
Examples
- 1.
Any recursive language.
- 2.
The set of encodings of Turing machines which halt when given no input.
- 3.
The set of encodings of theorems of Peano arithmetic
.
- 4.
The set of integers for which the hailstone sequence starting at reaches 1. (We don’t know if this set is recursive, or even if it is ; but a trivial program shows it is recursively enumerable.)