Supertasks do not increase computational power
From MaRDI portal
Publication:1761709
DOI10.1007/s11047-011-9280-yzbMath1251.68106MaRDI QIDQ1761709
Publication date: 15 November 2012
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-011-9280-y
Turing machines; supertasks; accelerating Turing machines; halting function; hyper computation; relativistic machines
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Output concepts for accelerated Turing machines
- General relativistic hypercomputing and foundation of mathematics
- \(\omega\)-computations on Turing machines
- Super-tasks, accelerating Turing machines and uncomputability
- Embedding infinitely parallel computation in Newtonian kinematics
- Revision Sequences and Computers with an Infinite Amount of Time
- A note on accelerated Turing machines
- Building Infinite Machines
- Infinite time Turing machines
- Deciding Arithmetic Using SAD Computers
- The Extent of Computation in Malament–Hogarth Spacetimes
- Accelerating machines: a review
- Non-Turing computations via Malament--Hogarth space-times