Download presentation

Presentation is loading. Please wait.

Published byFiona Prude Modified over 2 years ago

1
Budapest, September 10, 2012Relativistic ComputingPage: 1

2
Church Thesis was formulated in Newtonian worldview Turing Machine concept incorporates ABSOLUTE TIME Budapest, September 10, 2012Relativistic ComputingPage: 2 you can MANIPULATE TIME (just like space) after Black Hole Physics breaking the Turing Barrier becomes conceivable

3
Black hole computing Wormhole computing (astrophysicist Igor Novikov) Comparison, realisticity issues Budapest, September 10, 2012Relativistic ComputingPage: 3

4
Budapest, September 10, 2012Relativistic ComputingPage: 4 Gravity causes slow time New physics brings in new horizons, new possibilities and breaks old barriers.

5
Budapest, September 10, 2012 Relativistic Computing Page: μs/day because of gravity -7 μs/day because of the speed of sat. approx. 4 km/s (14400 km/h) Relativistic Correction: 38 μs/day approx. 10 km/day Global Positioning System

6
Budapest, September 10, 2012Relativistic ComputingPage: 6 We want to use the GR effect that gravity causes slow time to decide an arbitrary recursively enumerable set. We will show the idea in two levels of abstraction. 1.In Cartoon-like pictures 2.The same idea in spacetime diagrams

7
Budapest, September 10, 2012Relativistic ComputingPage: 7

8
Budapest, September 10, 2012Relativistic ComputingPage: 8

9
Budapest, September 10, 2012Relativistic ComputingPage: 9

10
Budapest, September 10, 2012Relativistic ComputingPage: 10 Let us see in more mathematical detail how this fairy tale can be implemented in terms of GR spacetime diagrams.

11
Budapest, September 10, 2012Relativistic ComputingPage: 11

12
Budapest, September 10, 2012Relativistic ComputingPage: 12

13
Budapest, September 10, 2012Relativistic ComputingPage: 13 Malament-Hogarth event! Etesi-Nemeti paper: computations Infinite space inside

14
Budapest, September 10, 2012Relativistic ComputingPage: Blue shift (communication) 2. Evaporation of BH 3. Strong Cosmic Censor Hypothesis 4. Instability of Cauchy Horizon 5. Blue shift (cosmic, distant galaxies) 6. Unlimited tape 7. Predictability, Repeatability, Radiation from singularity 8. Decay of protons 9. Heat Death

15
Budapest, September 10, 2012Relativistic ComputingPage: 15 Cauchy horizon outer event horizon worldline of programmer worldline of computer photon signal communication messenger communication already solved in [ND], Fig.5, sec.5.3.2, p.133

16
Budapest, September 10, 2012Relativistic ComputingPage: 16 Shielding (only gradually) CMB Apostolos book, p.146 Evaporation is only hypothetical Penrose 2004, p.848: … BH evaporation is an entirely theoretical … might be that Nature has other ideas for future of BHs. Papers: Nikolic, H., Black holes radiate but do not evaporate. arXiv:hep- th/ v3, Aug Helfer,A. D., Do black holes radiate? arXiv:gr-qc/ v1, Apr Therefore since we are using a huge BH for hypercomputing, Hawking radiation should cause no problem.

17
Budapest, September 10, 2012Relativistic ComputingPage: Strong Cosmic Censor 4. Instability of Cauchy Horizon 5. Blue shift (cosmic, distant galaxies) - Expansion of Universe forever - Asymptotically de Sitter background implies stability

18
Budapest, September 10, 2012Relativistic ComputingPage: 18 worldlines of galaxies photon geodesics worldlines of galaxies t cosmological event horizon

19
Budapest, September 10, 2012Relativistic ComputingPage: 19 r = 0singularity r = 0 I+I+ I+I+ BH interior distant galaxies (Olbers paradox) worldline of computer : Inner event horizon (Cauchy horizon) 2: Outer event horizon 3: Cosmological event horizon Kerr-Newmann-deSitter space-time

20
Budapest, September 10, 2012Relativistic ComputingPage: 20 Papers for fall of censor: Joshi, P.S., Do naked singularities break the rules of physics? Scientific American, January Chambers, C. M., The Cauchy horizon in black hole-de Sitter spacetimes. arXiv:gr-qc/ v1, Sep German,W.S., Moss, I.A., Cauchy horizon stability and cosmic censorship. arXiv:gr-qc/ v1, Mar Lobo, F.X. N., Exotic solutions in general relativity: traversable wormholes and warp drive spacetimes. arXiv: v1 Oct 2007.

21
Budapest, September 10, 2012Relativistic ComputingPage: 21 Weak Energy Condition is not LAW: Barcelo, C., Visser, M., Twilight for the energy conditions?, Int. J. Mod. Phys. C 11 (2002), arXiv:gr-qc/ Cosmology accelerated expansion, dark energy Wormholes boom implies new kinds of MH-regions

22
Budapest, September 10, 2012Relativistic ComputingPage: Unlimited tape information energy 7. Predictability Repeatability Radiation from singularity New orbit for programmer 8. Decay of protons Small enough particles do not decay (electron, positron, neutrino) 9. Heat Death

23
We reviewed BH computing, now comes WH computing. This is another kind of thought-experiment, based on a different GR space-time Both have advantages and disadvantages. WH computing: can compute more complex problems, is smaller, no need for Noahs Ark Budapest, September 10, 2012Relativistic ComputingPage: 23

24
AB Budapest, September 10, 2012Relativistic ComputingPage: 24 A B Long path (outside) Short path (inside) unfold

25
AB Budapest, September 10, 2012Relativistic ComputingPage: 25 Short path (inside) AB t Long path (outside)

26
Budapest, September 10, 2012Relativistic ComputingPage: 26

27
Budapest, September 10, 2012Relativistic ComputingPage: 27 t BA r r = 0 Signal outside WH From A to B Signal inside WH From B to A Event horizon of BH

28
Budapest, September 10, 2012Relativistic ComputingPage: 28 t BA r r = 0 Signal outside WH From A to B Signal inside WH From B to A Event horizon of BH

29
Budapest, September 10, 2012Relativistic ComputingPage: 29 t BA r Signal outside WH From A to B Signal inside WH From B to A BlackHole disappears BlackHole appears

30
Budapest, September 10, 2012Relativistic ComputingPage: 30 Designing the wormhole computer Task is: decide for any recursive set S whether S is finite or infinite. S is specified by fixing a number theoretic 0 -formula Φ(x) S x : Φ(x) We will check whether there is a greatest x with Φ(x).

31
C a – Turing machine (TM) at mouth A (see its program later) M a – Mirror at mouth A (acts either as a mirror or a prism) Mirror: reflects signals coming from the wormhole towards M b outside the wormhole Prism: filters red light, reflects green towards M b C b – TM at mouth B (see its program later) M b – Mirror at mouth B Reflects light signals coming from C b or M a into the wormhole towards M a Pr – Programmer (checks incoming signals on M a till T MH ) Red and Green light means there are finitely many x such that Φ(x) Only Red light means there are infinitely many x such that Φ(x) No signals means there is no x such that Φ(x) Budapest, September 10, 2012Relativistic ComputingPage: 31

32
Budapest, September 10, 2012Relativistic ComputingPage: 32 Wait T MH time Φ(x) & Flash Infinite many x Φ(x) Finite many x Φ(x) Pr CaCa MaMa MbMb CbCb Wormhole time gap (Malament-Hogard event) Inside WH Outside WH

33
Budapest, September 10, 2012Relativistic ComputingPage: 33 Pr CaCa MaMa MbMb CbCb

34
Budapest, September 10, 2012Relativistic ComputingPage: 34 Pr CaCa MaMa MbMb CbCb

35
How much more? Beyond-Turing complexity issues: Jiri Wiedermann, Philip Welch, Marek Suchenek, Mark Hogarth BH decidable problems are all Budapest, September 10, 2012Relativistic ComputingPage: 35

36
Theorem (P. Welch): BH can compute all problems if and only if one can create a computer which able to receive an arbitrary large (but finite) amount of information. WH can decide all problems. Question: can WH decide all n problems by using perhaps n WH-s? Budapest, September 10, 2012Relativistic ComputingPage: 36

37
BHs observed Blue shift problem: BHs are focusing lenses No time travel We need big BHs Programmer travels BH can compute less WHs not yet observed WHs are defocusing lenses (no bs roblem) Time travel WHs may be small No need for Noahs Ark WH can compute more Budapest, September 10, 2012Relativistic ComputingPage: 37

38
Budapest, September 10, 2012Relativistic Hyper ComputingPage: 38

39
Budapest, September 10, 2012Relativistic ComputingPage: 39

40
You can read more on Istvan Nemetis homepage: Budapest, September 10, 2012Relativistic ComputingPage: 40

41
Budapest, September 10, 2012Relativistic Hyper ComputingPage: 41

Similar presentations

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google