Classes of recursively enumerable sets and their decision problems

  • Rice H
  • 94


    Mendeley users who have this article in their library.
  • 211


    Citations of this article.


In this paper we consider classes whose elements are re- cursively enumerable sets of non-negative integers. No discussion of recur- sively enumerable sets can avoid the use of such classes, so that it seems de- sirable to know some of their properties. We give our attention here to the properties of complete recursive enumerability and complete recursiveness (which may be intuitively interpreted as decidability). Perhaps our most interesting result (and the one which gives this paper its name) is the fact that no nontrivial class is completely recursive. We assume familiarity with a paper of Kleene [5](2), and with ideas which are well summarized in the first sections of a paper of Post [7].

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • H. G. Rice

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free