Nonexistence of minimal pairs for generic computability (Q5300075): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2024128940
@@ Property / OpenAlex ID: W2024128940 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.2560
@@ Property / arXiv ID: 1202.2560 / rank @@
+Normal rank
@@ Property / cites work @@
+Average Case Complete Problems
@@ Property / cites work: Average Case Complete Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Generic-case complexity, decision problems in group theory, and random walks.
+Normal rank
@@ Property / cites work @@
+ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS
@@ Property / cites work: ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS / rank @@
+Normal rank
@@ Property / cites work @@
+Average case completeness
@@ Property / cites work: Average case completeness / rank @@
+Normal rank
@@ Property / cites work @@
+Generic computability, Turing degrees, and asymptotic density
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5300075