Computation as an unbounded process (Q418791): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2011.12.040
@@ Property / DOI: 10.1016/j.tcs.2011.12.040 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2011.12.040
+Normal rank
@@ Property / OpenAlex ID @@
+W2024920805
@@ Property / OpenAlex ID: W2024920805 / rank @@
+Normal rank
@@ Property / cites work @@
+Alternation
@@ Property / cites work: Alternation / rank @@
+Normal rank
@@ Property / cites work @@
+\(\omega\)-computations on Turing machines
@@ Property / cites work: \(\omega\)-computations on Turing machines / rank @@
+Normal rank
@@ Property / cites work @@
+Q4792712
@@ Property / cites work: Q4792712 / rank @@
+Normal rank
@@ Property / cites work @@
+Non-Turing computations via Malament--Hogarth space-times
+Normal rank
@@ Property / cites work @@
+Limiting recursion
@@ Property / cites work: Limiting recursion / rank @@
+Normal rank
@@ Property / cites work @@
+Language identification in the limit
@@ Property / cites work: Language identification in the limit / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Arithmetical hierarchy and complexity of computation
+Normal rank
@@ Property / cites work @@
+Infinite time Turing machines
@@ Property / cites work: Infinite time Turing machines / rank @@
+Normal rank
@@ Property / cites work @@
+Q4369834
@@ Property / cites work: Q4369834 / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding Arithmetic Using <i>SAD</i> Computers
@@ Property / cites work: Deciding Arithmetic Using <i>SAD</i> Computers / rank @@
+Normal rank
@@ Property / cites work @@
+Recursive Predicates and Quantifiers
@@ Property / cites work: Recursive Predicates and Quantifiers / rank @@
+Normal rank
@@ Property / cites work @@
+Classical recursion theory. The theory of functions and sets of natural numbers.
+Normal rank
@@ Property / cites work @@
+Zeno machines and hypercomputation
@@ Property / cites work: Zeno machines and hypercomputation / rank @@
+Normal rank
@@ Property / cites work @@
+Trial and error predicates and the solution to a problem of Mostowski
+Normal rank
@@ Property / cites work @@
+Q5573961
@@ Property / cites work: Q5573961 / rank @@
+Normal rank
@@ Property / cites work @@
+Infinite Computations and a Hierarchy in Δ 3
@@ Property / cites work: Infinite Computations and a Hierarchy in Δ 3 / rank @@
+Normal rank
@@ Property / cites work @@
+Iterated Limiting Recursion and the Program Minimization Problem
+Normal rank
@@ Property / cites work @@
+Q4714446
@@ Property / cites work: Q4714446 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385530
@@ Property / cites work: Q4385530 / rank @@
+Normal rank
@@ Property / cites work @@
+On Computable Numbers, with an Application to the Entscheidungsproblem
+Normal rank
@@ Property / cites work @@
+Systems of Logic Based on Ordinals<sup>†</sup>
@@ Property / cites work: Systems of Logic Based on Ordinals<sup>†</sup> / rank @@
+Normal rank
@@ Property / cites work @@
+Q2762165
@@ Property / cites work: Q2762165 / rank @@
+Normal rank
@@ Property / cites work @@
+The Extent of Computation in Malament–Hogarth Spacetimes
+Normal rank
@@ Property / cites work @@
+Q4437108
@@ Property / cites work: Q4437108 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2011.12.040
@@ Property / DOI: 10.1016/J.TCS.2011.12.040 / rank @@
+Normal rank