A generic relation on recursively enumerable sets
From MaRDI portal
Publication:2364345
DOI10.1007/s10469-016-9410-9zbMath1403.03065OpenAlexW2558073738MaRDI QIDQ2364345
Publication date: 18 July 2017
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10469-016-9410-9
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items
Cites Work
- Unnamed Item
- Average-case complexity and decision problems in group theory.
- Generic-case complexity, decision problems in group theory, and random walks.
- The halting problem is decidable on a set of asymptotic probability one
- THE GENERIC DEGREES OF DENSITY-1 SETS, AND A CHARACTERIZATION OF THE HYPERARITHMETIC REALS
- Generic computability, Turing degrees, and asymptotic density