UNIFORM ENUMERATION OPERATIONS.
Abstract
Operations are considered, such as the jump operation on the degrees of unsolvability. Let phi be an operation mapping sets of natural numbers into sets of natural numbers such that phi (X) is uniformly recursively enumerable in X. Let phi be such that if reductions of A to B and vice-versa are given then reductions of phi (A) to phi (B) and vice-versa can be found effectively. The operation that phi induces on the degrees of unsolvability is called a 'uniform enumeration operation.' Several properties of such operations are found. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 01, 1969
- Accession Number
- AD0696952
Entities
People
- Alistair H. Lachlan
Organizations
- University of Iowa