On the generic undecidability of the halting problem for normalized Turing machines (Q2398210): Difference between revisions

@@ Property / DOI @@
-.1007/s00224-016-9698-9
@@ Property / DOI: 10.1007/s00224-016-9698-9 / 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.1007/s00224-016-9698-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2464573758
@@ Property / OpenAlex ID: W2464573758 / rank @@
+Normal rank
@@ Property / cites work @@
+Most programs stop quickly or never halt
@@ Property / cites work: Most programs stop quickly or never halt / rank @@
+Normal rank
@@ Property / cites work @@
+A Theory of Program Size Formally Identical to Information Theory
+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 @@
+On the strongly generic undecidability of the halting problem
+Normal rank
@@ Property / DOI @@
+.1007/S00224-016-9698-9
@@ Property / DOI: 10.1007/S00224-016-9698-9 / rank @@
+Normal rank