On the strongly generic undecidability of the halting problem (Q884482): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2007.02.010
@@ Property / DOI: 10.1016/j.tcs.2007.02.010 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2007.02.010
+Normal rank
@@ Property / OpenAlex ID @@
+W1983360706
@@ Property / OpenAlex ID: W1983360706 / rank @@
+Normal rank
@@ Property / cites work @@
+MULTIPLICATIVE MEASURES ON FREE GROUPS
@@ Property / cites work: MULTIPLICATIVE MEASURES ON FREE GROUPS / rank @@
+Normal rank
@@ Property / cites work @@
+The halting problem is decidable on a set of asymptotic probability one
+Normal rank
@@ Property / cites work @@
+Generic-case complexity, decision problems in group theory, and random walks.
+Normal rank
@@ Property / cites work @@
+Average-case complexity and decision problems in group theory.
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2007.02.010
@@ Property / DOI: 10.1016/J.TCS.2007.02.010 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:884482