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 set; Turing machine; computability; generalized recursion; Blum-Shub-Smale

Mathematics Subject Classification ID

03Dxx: Computability and recursion theory