Informal construction -- Formal construction -- Limiting results
Summary
Two of the central concepts for the study of degree structures in computability theory are computably enumerable degrees and minimal degrees. For strong notions of reducibility, such as m-deducibility or truth table reducibility, it is possible for computably enumerable degrees to be minimal. For weaker notions of reducibility, such as weak truth table reducibility or Turing reducibility, it is not possible to combine these properties in a single degree. We consider how minimal weak truth table degrees interact with computably enumerable Turing degrees and obtain three main results. First, the
Notes
"May 2020" per title page
Bibliography
Includes bibliographical references
Notes
Description based on online resource; title from digital title page (viewed on July 31, 2020)
