The basic theory of infinite time register machines (Q2267751): Difference between revisions

@@ Property / cites work @@
+Infinite time Turing machines
@@ Property / cites work: Infinite time Turing machines / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Quickly ORM-Decidable Sets
@@ Property / cites work: The Complexity of Quickly ORM-Decidable Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Post’s Problem for Ordinal Register Machines
@@ Property / cites work: Post’s Problem for Ordinal Register Machines / rank @@
+Normal rank
@@ Property / cites work @@
+Logical Approaches to Computational Barriers
@@ Property / cites work: Logical Approaches to Computational Barriers / rank @@
+Normal rank
@@ Property / cites work @@
+Turing Computations On Ordinals
@@ Property / cites work: Turing Computations On Ordinals / rank @@
+Normal rank
@@ Property / cites work @@
+An Enhanced Theory of Infinite Time Register Machines
+Normal rank
@@ Property / cites work @@
+Register computations on ordinals
@@ Property / cites work: Register computations on ordinals / rank @@
+Normal rank
@@ Property / cites work @@
+Ordinal machines and admissible recursion theory
@@ Property / cites work: Ordinal machines and admissible recursion theory / rank @@
+Normal rank
@@ Property / cites work @@
+Minimality considerations for ordinal computers modeling constructibility
+Normal rank
@@ Property / cites work @@
+The fine structure of the constructible hierarchy
@@ Property / cites work: The fine structure of the constructible hierarchy / rank @@
+Normal rank