Super-tasks, accelerating Turing machines and uncomputability

DOI10.1016/j.tcs.2003.12.007zbMath1072.68042OpenAlexW2064371665WikidataQ55968644 ScholiaQ55968644MaRDI QIDQ1434371

Oron Shagrir

Publication date: 4 August 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.12.007

zbMATH Keywords

Halting problemAccelerating Turing machinesSuper-taskThomson's paradox

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (4)

Supertasks do not increase computational power ⋮ The case for hypercomputation ⋮ A note on accelerated Turing machines ⋮ Accelerating machines: a review

Cites Work

• Energy conservation and supertasks
• Infinite time Turing machines
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Systems of Logic Based on Ordinals^†
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Super-tasks, accelerating Turing machines and uncomputability