Infinite Time Turing Machines With Only One Tape
From MaRDI portal
Publication:2720332
DOI<link itemprop=identifier href="https://doi.org/10.1002/1521-3870(200105)47:2<271::AID-MALQ271>3.0.CO;2-6" /><271::AID-MALQ271>3.0.CO;2-6 10.1002/1521-3870(200105)47:2<271::AID-MALQ271>3.0.CO;2-6zbMath0990.03031arXivmath/9907044OpenAlexW2015497757MaRDI QIDQ2720332
Joel David Hamkins, Daniel Evan Seabold
Publication date: 5 June 2002
Full work available at URL: https://arxiv.org/abs/math/9907044
Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items (9)
On fixpoint arithmetic and infinite time Turing machines ⋮ Output concepts for accelerated Turing machines ⋮ Discrete Transfinite Computation ⋮ Symmetry for transfinite computability ⋮ The computational strengths of \(\alpha\)-tape infinite time Turing machines ⋮ GENERICITY AND RANDOMNESS WITH ITTMS ⋮ Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems ⋮ Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines ⋮ Clockability for ordinal Turing machines
This page was built for publication: Infinite Time Turing Machines With Only One Tape
