Weaker variants of infinite time Turing machines

DOI10.1007/S00153-019-00692-9zbMath1455.03049OpenAlexW2972938863WikidataQ127240606 ScholiaQ127240606MaRDI QIDQ2309496

Matteo Bianchetti

Publication date: 1 April 2020

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-019-00692-9

zbMATH Keywords

arithmetic hierarchyreal arithmetictransfinite computationsupertaskordinal computabilityinfinite time Turing machine

Mathematics Subject Classification ID

Turing machines and related notions (03D10) General topics in the theory of computing (68Q01) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Computation over the reals, computable analysis (03D78)

Related Items (1)

Weaker variants of infinite time Turing machines

Cites Work

• Unnamed Item
• Ordinal computability. An introduction to infinitary machines
• Weaker variants of infinite time Turing machines
• Infinite time Turing machines
• CONSTRUCTIVE GEOMETRY AND THE PARALLEL POSTULATE

This page was built for publication: Weaker variants of infinite time Turing machines