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

DOI10.3233/COM-200301MaRDI QIDQ4995609

Philip D. Welch

Publication date: 25 June 2021

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.08001

zbMATH Keywords

admissible setTuring machinecomputabilitygeneralized recursionBlum-Shub-Smale

Mathematics Subject Classification ID

Computability and recursion theory (03Dxx)

Cites Work

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

This page was built for publication: Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines