Towards formal verification of computations and hypercomputations in relativistic physics

DOI10.1007/978-3-319-23111-2_2zbMATH Open1415.03032OpenAlexW2232149463WikidataQ57691180 ScholiaQ57691180MaRDI QIDQ2945876FDOQ2945876

Authors: Mike Stannett 

Publication date: 15 September 2015

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

Full work available at URL: http://eprints.whiterose.ac.uk/86607/1/2015-stannett-mcu.pdf

Recommendations

• scientific article; zbMATH DE number 1909825
• Relativistic computers and the Turing barrier
• The case for hypercomputation
• General relativistic hypercomputing and foundation of mathematics
• Hypercomputation: Philosophical issues

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Complexity of computation (including implicit computational complexity) (03D15) General relativity (83C99)

Cited In (3)

• Existence of faster than light signals implies hypercomputation already in special relativity
• Relativistic computers and the Turing barrier
• The significance of relativistic computation for the philosophy of mathematics

This page was built for publication: Towards formal verification of computations and hypercomputations in relativistic physics

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