Anytime Algorithms for Non-Ending Computations (Q2947801): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Strong noncomputability of random strings
@@ Property / cites work: Strong noncomputability of random strings / 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 @@
+Natural halting probabilities, partial randomness, and zeta functions
+Normal rank
@@ Property / cites work @@
+The halting problem is decidable on a set of asymptotic probability one
+Normal rank
@@ Property / cites work @@
+Renormalisation and computation II: time cut-off and the Halting Problem
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1142/s0129054115500252
+Normal rank
@@ Property / OpenAlex ID @@
+W2237358699
@@ Property / OpenAlex ID: W2237358699 / rank @@
+Normal rank