Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines (Q4995609): Difference between revisions

Latest revision as of 02:24, 26 July 2024

scientific article; zbMATH DE number 7363331

Language	Label	Description	Also known as
English	Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines	scientific article; zbMATH DE number 7363331

Statements

instance of

scholarly article

0 references

title

Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines (English)

0 references

0 references

0 references

25 June 2021

0 references

full work available at URL

https://arxiv.org/abs/2012.08001

0 references

zbMATH Keywords

Turing machine

0 references

computability

0 references

Blum-Shub-Smale

0 references

generalized recursion

0 references

admissible set

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q4075450

0 references

SAFE RECURSIVE SET FUNCTIONS

0 references

A strengthening of Jensen's □ principles

0 references

The truth is never simple

0 references

Ordinal computability. An introduction to infinitary machines

0 references

Clockability for ordinal Turing machines

0 references

Q3329455

0 references

Q3929732

0 references

Q4845457

0 references

Infinite time Turing machines

0 references

Infinite Time Turing Machines With Only One Tape

0 references

Q5625138

0 references

Turing-Machine Computable Functionals of Finite Types II<sup>†</sup>

0 references

Q5586296

0 references

Turing Computations On Ordinals

0 references

Towards a Theory of Infinite Time Blum-Shub-Smale Machines

0 references

Revision Sequences and Computers with an Infinite Amount of Time

0 references

The theory of transfinite recursion

0 references

Elementary induction on abstract structures

0 references

The computational strengths of \(\alpha\)-tape infinite time Turing machines

0 references

Q4220572

0 references

On the recursive functions of ordinal numbers

0 references

Eventually infinite time Turing machine degrees: infinite time decidable reals

0 references

On revision operators

0 references

Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems

0 references

Identifiers

DOI

10.3233/COM-200301

0 references

Mathematics Subject Classification ID

03Dxx

0 references

zbMATH DE Number

7363331

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4995609

@@ Property / cites work @@
+Q4075450
@@ Property / cites work: Q4075450 / rank @@
+Normal rank
@@ Property / cites work @@
+SAFE RECURSIVE SET FUNCTIONS
@@ Property / cites work: SAFE RECURSIVE SET FUNCTIONS / rank @@
+Normal rank
@@ Property / cites work @@
+A strengthening of Jensen's □ principles
@@ Property / cites work: A strengthening of Jensen's □ principles / rank @@
+Normal rank
@@ Property / cites work @@
+The truth is never simple
@@ Property / cites work: The truth is never simple / rank @@
+Normal rank
@@ Property / cites work @@
+Ordinal computability. An introduction to infinitary machines
+Normal rank
@@ Property / cites work @@
+Clockability for ordinal Turing machines
@@ Property / cites work: Clockability for ordinal Turing machines / rank @@
+Normal rank
@@ Property / cites work @@
+Q3329455
@@ Property / cites work: Q3329455 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3929732
@@ Property / cites work: Q3929732 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4845457
@@ Property / cites work: Q4845457 / rank @@
+Normal rank
@@ Property / cites work @@
+Infinite time Turing machines
@@ Property / cites work: Infinite time Turing machines / rank @@
+Normal rank
@@ Property / cites work @@
+Infinite Time Turing Machines With Only One Tape
@@ Property / cites work: Infinite Time Turing Machines With Only One Tape / rank @@
+Normal rank
@@ Property / cites work @@
+Q5625138
@@ Property / cites work: Q5625138 / rank @@
+Normal rank
@@ Property / cites work @@
+Turing-Machine Computable Functionals of Finite Types II<sup>†</sup>
+Normal rank
@@ Property / cites work @@
+Q5586296
@@ Property / cites work: Q5586296 / rank @@
+Normal rank
@@ Property / cites work @@
+Turing Computations On Ordinals
@@ Property / cites work: Turing Computations On Ordinals / rank @@
+Normal rank
@@ Property / cites work @@
+Towards a Theory of Infinite Time Blum-Shub-Smale Machines
+Normal rank
@@ Property / cites work @@
+Revision Sequences and Computers with an Infinite Amount of Time
+Normal rank
@@ Property / cites work @@
+The theory of transfinite recursion
@@ Property / cites work: The theory of transfinite recursion / rank @@
+Normal rank
@@ Property / cites work @@
+Elementary induction on abstract structures
@@ Property / cites work: Elementary induction on abstract structures / rank @@
+Normal rank
@@ Property / cites work @@
+The computational strengths of \(\alpha\)-tape infinite time Turing machines
+Normal rank
@@ Property / cites work @@
+Q4220572
@@ Property / cites work: Q4220572 / rank @@
+Normal rank
@@ Property / cites work @@
+On the recursive functions of ordinal numbers
@@ Property / cites work: On the recursive functions of ordinal numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Eventually infinite time Turing machine degrees: infinite time decidable reals
+Normal rank
@@ Property / cites work @@
+On revision operators
@@ Property / cites work: On revision operators / rank @@
+Normal rank
@@ Property / cites work @@
+Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems
+Normal rank