- Full text PDF available (3)
- This year (0)
- Last 5 years (1)
- Last 10 years (3)
Looking at very recent developments in spacetime theory, we can wonder whether these results exhibit features of hypercomputation that traditionally seemed impossible or absurd. Namely, we describe a physical device in relativistic spacetime which can compute a non-Turing computable task, e.g. which can decide the halting problem of Turing machines or… (More)
Within an axiomatic framework, we investigate the possibility of hypercomputation in special relativity via faster than light signals. We formally show that hypercomputation is theoretically possible in special relativity if and only if there are faster than light signals.