The world problem: on the computability of the topology of 4-manifolds

Details The world problem: on the computability of the topology of 4-manifolds The world problem: on the computability of the topology of 4-manifolds

2005-06-03

arxiv.org/abs/gr-qc/0506019v1

Astronomy and Astrophysics

Astrophysics

General Relativity and Quantum Cosmology

Submitted to Class. Quant. Grav

Scientific paper

Topological classification of the 4-manifolds bridges computation theory and physics. A proof of the undecidability of the homeomorphy problem for 4-manifolds is outlined here in a clarifying way. It is shown that an arbitrary Turing machine with an arbitrary input can be encoded into the topology of a 4-manifold, such that the 4-manifold is homeomorphic to a certain other 4-manifold if and only if the corresponding Turing machine halts on the associated input. Physical implications are briefly discussed.

Affiliated with

Also associated with

No associations

Rating

The world problem: on the computability of the topology of 4-manifolds does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The world problem: on the computability of the topology of 4-manifolds, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The world problem: on the computability of the topology of 4-manifolds will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-403195