Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Query-limited reducibilities
Why interaction is more powerful than algorithms
Communications of the ACM
Complexity and real computation
Complexity and real computation
How we know what technology can do
Communications of the ACM
The complexity theory companion
The complexity theory companion
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Emergence of a Super-Turing Computational Potential in Artificial Living Systems
ECAL '01 Proceedings of the 6th European Conference on Advances in Artificial Life
Beyond the Turing Limit: Evolving Interactive Systems
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
A broader view on the limitations of information processing and communication by nature
Natural Computing: an international journal
Evolved Computing Devices and the Implementation Problem
Minds and Machines
(Short) Survey of Real Hypercomputation
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
How We Think of Computing Today
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
General relativistic hypercomputing and foundation of mathematics
Natural Computing: an international journal
A note on accelerated turing machines
Mathematical Structures in Computer Science
Can general relativistic computers break the turing barrier?
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
New physics and hypercomputation
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Computation as an unbounded process
Theoretical Computer Science
| Hi-index | 0.00 |
Recent research in theoretical physics on 'Malament-Hogarth space-times' indicates that so-called relativistic computers can be conceived that can carry out certain classically undecidable queries in finite time. We observe that the relativistic Turing machines which model these computations recognize precisely the 驴2-sets of the Arithmetical Hierarchy. In a complexity-theoretic analysis, we show that the (infinite) computations of S(n)-space bounded relativistic Turing machines are equivalent to (finite) computations of Turing machines that use a S(n)- bounded advice f, where f itself is computable by a S(n)-space bounded relativistic Turing machine. This bounds the power of polynomial-space bounded relativistic Turing machines by TM/poly. We also show that S(n)-space bounded relativistic Turing machines can be limited to one or two relativistic phases of computing.