Relativistic Computers and Transfinite Computation

DOI10.1007/978-3-642-03745-0_11MaRDI QIDQ3184755zbMATH OpenOpenAlexFDO

Authors Philip D. Welch

Publication date 22 October 2009

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

Full work available at URL https://doi.org/10.1007/978-3-642-03745-0_11

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Complexity of computation (including implicit computational complexity) (03D15) Second- and higher-order arithmetic and fragments (03F35)

Recommendations

• scientific article; zbMATH DE number 2013816
• Non-Turing computations via Malament--Hogarth space-times
• Infinite time Turing machines

Cited in

(6)

• Zeno machines and hypercomputation
• scientific article; zbMATH DE number 20260 (Why is no real title available?)
• scientific article; zbMATH DE number 2013816 (Why is no real title available?)
• Deciding Arithmetic Using SAD Computers
• The Extent of Computation in Malament–Hogarth Spacetimes
• General relativistic hypercomputing and foundation of mathematics

This page was built for publication: Relativistic Computers and Transfinite Computation

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