The world problem: on the computability of the topology of 4-manifolds
| dc.creator | van Meter, James R. | |
| dc.date | 2005-06-03 | |
| dc.date.accessioned | 2026-07-07T03:29:46Z | |
| dc.date.available | 2026-07-07T03:29:46Z | |
| dc.description | 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. | |
| dc.description | Submitted to Class. Quant. Grav | |
| dc.identifier | https://arxiv.org/abs/gr-qc/0506019 | |
| dc.identifier | http://arxiv.org/abs/gr-qc/0506019 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/35307 | |
| dc.subject | General Relativity and Quantum Cosmology | |
| dc.title | The world problem: on the computability of the topology of 4-manifolds | |
| dc.type | text |