Relativistic computers and the Turing barrier

DOI10.1016/j.amc.2005.09.075zbMath1104.68048OpenAlexW2117289751MaRDI QIDQ2497881

Gyula Dávid, Istvan Németi

Publication date: 4 August 2006

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2005.09.075

zbMATH Keywords

hypercomputation

Mathematics Subject Classification ID

Related Items (20)

The impact of models of a physical oracle on computational power ⋮ Can Newtonian systems, bounded in space, time, mass and energy compute all functions? ⋮ A broader view on the limitations of information processing and communication by nature ⋮ Physical Computability Theses ⋮ HYPERCOMPUTATION: FANTASY OR REALITY? A POSITION PAPER ⋮ A quantum-information-theoretic complement to a general-relativistic implementation of a beyond-Turing computer ⋮ The machine as data: a computational view of emergence and definability ⋮ A twist in the geometry of rotating black holes: seeking the cause of acausality ⋮ Hyperloops Do Not Threaten the Notion of an Effective Procedure ⋮ Embedding infinitely parallel computation in Newtonian kinematics ⋮ How much can analog and hybrid systems be proved (super-)Turing ⋮ General relativistic hypercomputing and foundation of mathematics ⋮ The computational status of physics ⋮ A new problem for rule following ⋮ Abstract geometrical computation. III: Black holes for classical and analog computing ⋮ Theory of Quantum Computation and Philosophy of Mathematics. Part II ⋮ CLOSED TIMELIKE CURVES IN RELATIVISTIC COMPUTATION ⋮ The Significance of Relativistic Computation for the Philosophy of Mathematics ⋮ Using Isabelle/HOL to verify first-order relativity theory ⋮ A Survey on Analog Models of Computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Note on a reformulation of the strong cosmic censor conjecture based on computability
• Radiative evolution of orbits around a Kerr black hole
• The case for hypercomputation
• Embedding infinitely parallel computation in Newtonian kinematics
• Definability as hypercomputational effect
• The Church-Turing thesis: Still valid after all these years?
• Analog computation beyond the Turing limit
• The many forms of hypercomputation
• Church's thesis meets the \(N\)-body problem
• Comments on the instability of black-hole inner horizons
• Inner structure of a charged black hole: An exact mass-inflation solution
• Structure of the singularity inside a realistic rotating black hole
• Oscillatory Null Singularity inside Realistic Spinning Black Holes
• Machines, Logic and Quantum Physics
• Deciding Arithmetic Using SAD Computers
• The Large Scale Structure of Space-Time
• General Relativity
• Numerical approaches to spacetime singularities
• Non-Turing computations via Malament--Hogarth space-times

This page was built for publication: Relativistic computers and the Turing barrier