The complexity types of computable sets
Under an Elsevier user license
open archive
Cited by (0)
- ∗
Written under partial support by NSF Grant CCR 8903398. Part of this research was carried out during a visit of the first author at the University of Chicago. The first author thanks the Department of Computer Science at the University of Chicago for its hospitality.
- †
Written under partial support by Presidential Young Investigator Award DMS-8451748 and NSF Grant DMS-8601856.
Copyright © 1992 Published by Elsevier Inc.