Some results on enumeration reductibility.
Year: 1971
Type: article
Abstract: y was defined by Friedberg and Rogers i n 1959.Medvedev showed t h a t there a r e p a r t i a l degrees which a r e not t o t a l .Rogers i n h i s book Theory of Recursive Functions and Effective Computability gives a l l the basic r e s u l t s and d e f i n i t i o n s concerning enumeration r e d u c i b i l i t y and the p a r t i a l degrees.He mentions i n this book t h a t the existence of a minimal p a r t i a l degree i s an open problem.I n this t h e s i s it i s shown t h a t there a r e no minimal p a r t i a l degrees.This leads naturally t o the conjecture t h a t the p a r t i a l degrees a r e dense.This t h e s i s leaves this question unanswered, b u t it is shown t h a t there a r e no degrees minimal above a t o t a l degree, and there a r e a t most countably many degrees minimal above a non-total degree.J. W. Case has proved several r e s u l t s about the p a r t i a l degrees.He conjectured t h a t there is no s e t i n a t o t a l degree whose complement i s i n a non-total degree.I n t h i s t h e s i s t h a t conjecture is disproved.Finally, Case's r e s u l t t h a t there i s a minimal p a i r of p a r t i a l degrees i s strengthened t o s h o w t h a t there is a minimal p a i r of p a r t i a l degrees which a r e t o t a l and form a minimal p a i r of r.e.degrees. The content of this t h e s i s has been vastly influenced byProfessor A. H. Lachlan.
Source: Summit (Simon Fraser University)
Author: Lance Gutteridge
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2000500526
