scientific article; zbMATH DE number 7199593

MaRDI QIDQ5109524

Merlin Carl, Philipp Schlicht, Benjamin G. Rin

Publication date: 12 May 2020

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Ordinal machines and admissible recursion theory
• Taming Koepke's zoo
• The computational strengths of \(\alpha\)-tape infinite time Turing machines
• Hypermachines
• Turing Computations On Ordinals
• Ordinal Computability
• The Length of Infinite Time Turing Machine Computations
• Infinite time Turing machines
• Degrees of unsolvability of constructible sets of integers

This page was built for publication: