Simple set


In recursion theory a subset of the natural numbers is called a simple set if it is co-infinite and recursively enumerable, but every infinite subset of its complement fails to be enumerated recursively. Simple sets are examples of recursively enumerable sets that are not recursive.

Relation to Post's problem

Simple sets were devised by Emil Leon Post in the search for a non-Turing-complete recursively enumerable set. Whether such sets exist is known as Post's problem. Post had to prove two things in order to obtain his result, one is that the simple set, say A, does not Turing-reduce to the empty set, and that the K, the halting problem, does not Turing-reduce to A. He succeeded in the first part, but for the other part, he managed only to prove a many-one reduction.
It was affirmed by Friedberg and Muchnik in the 1950s using a novel technique called the priority method. They give a construction for a set that is simple, but fails to compute the halting problem.

Formal definitions and some properties