Existence of faster than light signals implies hypercomputation already in special relativity

DOI10.1007/978-3-642-30870-3_53zbMATH Open1357.68066arXiv1204.1773OpenAlexW3106249885MaRDI QIDQ2904449FDOQ2904449

Authors: Péter Németi, Gergely Székely 

Publication date: 14 August 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Abstract: 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.

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

Recommendations

• Closed timelike curves in relativistic computation
• Towards formal verification of computations and hypercomputations in relativistic physics
• General relativistic hypercomputing and foundation of mathematics
• The existence of superluminal particles is consistent with the kinematics of Einstein's special theory of relativity
• SOFSEM 2006: Theory and Practice of Computer Science

Mathematics Subject Classification ID

Special relativity (83A05)

Cited In (6)

• The existence of superluminal particles is consistent with the kinematics of Einstein's special theory of relativity
• In the Footsteps of Hilbert: The Andréka-Németi Group’s Logical Foundations of Theories in Physics
• Using Isabelle/HOL to verify first-order relativity theory
• The significance of relativistic computation for the philosophy of mathematics
• On the epistemological significance of the Hungarian project
• Can signals truly be faster than light?

This page was built for publication: Existence of faster than light signals implies hypercomputation already in special relativity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904449)