Now showing items 1-1 of 1

    • Recursive Properties of Abstract Complexity Classes 

      Landweber, L. H.; Robertson, E. L. (University of Wisconsin-Madison Department of Computer Sciences, 1970)
      It is proven that complexity classes of abstract measures of complexity need not be recursively enumerable, However, the complement of each class is shown to be r.e. The results are extended to complexity classes determined ...