๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Recursively enumerable bw-degrees

โœ Scribed by G. N. Kobzev


Publisher
SP MAIK Nauka/Interperiodica
Year
1977
Tongue
English
Weight
409 KB
Volume
21
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Strong Minimal Covers for Recursively En
โœ S. Barry Cooper ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 386 KB

## Abstract We prove that there exists a nonzero recursively enumerable Turing degree possessing a strong minimal cover. Mathematics Subject Classification: 03D30.