Can general relativistic computers break the turing barrier?

Authors:
István Németi;Hajnal Andréka
Affiliations:
Rényi Institute of Mathematics, Budapest, Hungary;Rényi Institute of Mathematics, Budapest, Hungary
Venue:
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Year:
2006

Citing 2
Cited 4

Relativistic Computers and Non-uniform Complexity Theory

UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
How can nature help us compute?

SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science

General relativistic hypercomputing and foundation of mathematics

Natural Computing: an international journal
Abstract geometrical computation 3: black holes for classical and analog computing

Natural Computing: an international journal
The computational status of physics

Natural Computing: an international journal
Using Isabelle/HOL to Verify First-Order Relativity Theory

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

- Can general relativistic computers break the Turing barrier? – Are there final limits to human knowledge? – Limitative results versus human creativity (paradigm shifts). – Gödel's logical results in comparison/combination with Gödel's relativistic results. – Can Hilbert's programme be carried through after all?