Minimality considerations for ordinal computers modeling constructibility (Q2482462): Difference between revisions

@@ Property / cites work @@
+Q5625129
@@ Property / cites work: Q5625129 / rank @@
+Normal rank
@@ Property / cites work @@
+Flow diagrams, turing machines and languages with only two formation rules
+Normal rank
@@ Property / cites work @@
+Infinite time Turing machines
@@ Property / cites work: Infinite time Turing machines / rank @@
+Normal rank
@@ Property / cites work @@
+Turing Computations On Ordinals
@@ Property / cites work: Turing Computations On Ordinals / rank @@
+Normal rank
@@ Property / cites work @@
+Register computations on ordinals
@@ Property / cites work: Register computations on ordinals / rank @@
+Normal rank
@@ Property / cites work @@
+Q5590814
@@ Property / cites work: Q5590814 / rank @@
+Normal rank
@@ Property / cites work @@
+Computability of Recursive Functions
@@ Property / cites work: Computability of Recursive Functions / rank @@
+Normal rank