Mike Stannett, University of Sheffield New Worlds of Computation, LIFO, Orléans, 23 May 2011.

Slides:



Advertisements
Similar presentations
by Robert Nemiroff Michigan Tech
Advertisements

Scott Aaronson (MIT) Based on joint work with John Watrous (U. Waterloo) BQP PSPACE Quantum Computing With Closed Timelike Curves.
Turing Machines January 2003 Part 2:. 2 TM Recap We have seen how an abstract TM can be built to implement any computable algorithm TM has components:
A Logic Based Foundation and Analysis of Relativity Theory and LogicPage: 1.
A note on ‘Einstein's special relativity beyond the speed of light by James M. Hill and Barry J. Cox’ by Hajnal Andréka, Judit X. Madarász, István Németi,
Two puzzles about omnipotence
Copyright © Cengage Learning. All rights reserved.
The Cosmological Argument by: Reid Goldsmith and Ben McAtee.
Amsterdam, September 27, 2014.The end of timePage: 1 Hajnal Andréka and István Németi Defining time and space experimentally.
SEQUENCES and INFINITE SERIES
Quantum One: Lecture 5a. Normalization Conditions for Free Particle Eigenstates.
Copyright © Cengage Learning. All rights reserved.
1 The Limits of Computation Intractable and Non-computable functions.
Philosophy 024: Big Ideas Prof. Robert DiSalle Talbot College 408, x85763 Office Hours: Monday and Wednesday.
The Problem of Induction Reading: ‘The Problem of Induction’ by W. Salmon.
Both finite sets, A and B, are relations. A= { (0,2), (1,3), (2,4) }
INFINITE SEQUENCES AND SERIES
Complexity 11-1 Complexity Andrei Bulatov Space Complexity.
Comp 205: Comparative Programming Languages Semantics of Imperative Programming Languages denotational semantics operational semantics logical semantics.
Gödel on Time and Relativity Dennis Dieks History and Foundations of Science Utrecht University.
“History would become an experimental science.” Carl Sagan ( )
CPSC 411, Fall 2008: Set 12 1 CPSC 411 Design and Analysis of Algorithms Set 12: Undecidability Prof. Jennifer Welch Fall 2008.
1 Undecidability Andreas Klappenecker [based on slides by Prof. Welch]
8 TECHNIQUES OF INTEGRATION. In defining a definite integral, we dealt with a function f defined on a finite interval [a, b] and we assumed that f does.
Interstellar Medium. Aristotle reasoned that if water carries water waves, something between the Sun and Earth’s atmosphere must be carrying the sunlight.
Principle of special relativity Their is inconsistency between EM and Newtonian mechanics, as discussed earlier Einstein proposed SR to restore the inconsistency.
Forecast & Event Control On what is and what cannot be possible Karl Svozil ITP-TUVienna
Fall 2004COMP 3351 A Universal Turing Machine. Fall 2004COMP 3352 Turing Machines are “hardwired” they execute only one program A limitation of Turing.
EE1J2 - Slide 1 EE1J2 – Discrete Maths Lecture 12 Number theory Mathematical induction Proof by induction Examples.
The Game of Algebra or The Other Side of Arithmetic The Game of Algebra or The Other Side of Arithmetic © 2007 Herbert I. Gross by Herbert I. Gross & Richard.
Quantum theory and Consciousness This is an interactive discussion. Please feel free to interrupt at any time with your questions and comments.
PLEASE NOTE: This PowerPoint is intended to be remodeled for the purposes of SlideFest.
Lecture 7: Ways of Knowing - Reason. Part 1: What is reasoning? And, how does it lead to knowledge?
The Theories of Time Travel
Wormholes and space warps Topics Ripples in space Wormholes Time warps Space warps Motivation A few spacetime oddities. 1.
WORMHOLE as shortcut Travel through hyperspace is like travel through middle of Earth vs. travel along surface Could travel long distances in short time.
Discrete dynamical systems and intrinsic computability Marco Giunti University of Cagliari, Italy
Atomic Sentences Chapter 1 Language, Proof and Logic.
LDK R Logics for Data and Knowledge Representation Modeling First version by Alessandro Agostini and Fausto Giunchiglia Second version by Fausto Giunchiglia.
TeV Gravity at LHC, Hawking’s Chronology Protection Conjecture
Unsolvability and Infeasibility. Computability (Solvable) A problem is computable if it is possible to write a computer program to solve it. Can all problems.
Newcomb’s paradox and spacetime Mark Hogarth Cambridge University 1.
Basic paradoxes of physics and Universal arrow of time Dr. Kupervasser Oleg.
General Relativity and the Expanding Universe Allan Johnston 4/4/06.
Course Overview and Road Map Computability and Logic.
Extragalactic Astronomy & Cosmology Lecture GR Jane Turner Joint Center for Astrophysics UMBC & NASA/GSFC 2003 Spring [4246] Physics 316.
September 27, 2013.The End of TimePage: 1. The end of Time (defining time and space) Hajnal Andréka and István Németi.
Math 104 Calculus I Part 6 INFINITE SERIES. Series of Constants We’ve looked at limits and sequences. Now, we look at a specific kind of sequential limit,
Notes on local determinism Days 12, 13 and 14 of Comp Sci 480.
Principle of Equivalence: Einstein 1907 Box stationary in gravity field Box falling freely Box accelerates in empty space Box moves through space at constant.
LECTURE 19 THE COSMOLOGICAL ARGUMENT CONTINUED. THE QUANTUM MECHANICAL OBJECTION DEPENDS UPON A PARTICULAR INTERPRETATION WE MIGHT REASONABLY SUSPEND.
Copyright © Cengage Learning. All rights reserved. 7 Techniques of Integration.
HUBBLE’S LAW Edwin Hubble Hubble’s Law “the farther away a galaxy is from its observer, the faster it appears to be moving away from the observer”
Department of Physics, National University of Singapore
Landau and Lifshitz, Classical Field Theory. Chapter One, The Principle of Relativity. In a separate document I have explained that section one of L&L’s.
Quadratic Functions (4) What is the discriminant What is the discriminant Using the discriminant Using the discriminant.
General Relativity and Cosmology The End of Absolute Space Cosmological Principle Black Holes CBMR and Big Bang.
Fundamentals of Informatics Lecture 13 Reduction Bas Luttik.
LECTURE 21 WHAT RATIONAL BEINGS ARE THERE?. VAN INWAGEN’S CHARACTERIZATION OF “RATIONAL” HE AVOIDS THE USE OF THE WORD “INTELLIGENT” IN FAVOR OF “RATIONAL”.
T. K. Ng (HKUST) The classical Universe Plan: This lecture: Review Pre-relativity/Quantum Mechanics picture of our physical universe You will learn some.
Black Holes and the Einstein-Rosen Bridge: Traversable Wormholes? Chad A. Middleton Mesa State College September 4, 2008.
Cosmological Computation Computers in a weird universe Patrick Rall Ph70 May 10, 2016.
Copyright © Cengage Learning. All rights reserved.
CSE 105 theory of computation
CSCE 411 Design and Analysis of Algorithms
Theory of Computation Turing Machines.
TECHNIQUES OF INTEGRATION
Copyright © Cengage Learning. All rights reserved.
Techniques of Integration
CSE 105 theory of computation
Presentation transcript:

Mike Stannett, University of Sheffield New Worlds of Computation, LIFO, Orléans, 23 May 2011

 Cosmological computation (what is it?)  First-order relativity theories (Andréka et al.)  Recent focus: Closed Timelike Curves [CTCs]  Do they exist?  FTL does NOT entail CTCs after all  Traversing a CTC: two distinct interpretations  How can they be used?

Exploiting cosmological structures for computational purposes

 Using structural properties of cosmology for computational purposes.  Malament-Hogarth spacetime  Slow Kerr black holes  Traversable wormholes  Typically involves two distinct observers  User experiences finite proper time  User sees Comp experience infinite proper time

Geometric Logic Budapest Hajnal Andréka, Judit Madarász, István Németi, Gergely Székely

 First-order logical representations of various versions of relativity theory  Goals:  What can be deduced within relativity theory?  Given a result, which axioms are required in its proof?  How far can the axioms be weakened and still generate cosmologically reasonable properties?

 Measurements take place in an ordered Euclidean field (one in which positive values have square roots)  Need not be the real numbers  Can include infinitesimals  Observers consider themselves to be stationary (world line = local time axis)  Each observer says that the speed of light is constant

Do they exist? What kinds can there be? How might they be used? Aren't they something to do with (banned) FTL travel? No!

Van Stockum's Spacetime From: Kip Thorne (1993) "Closed Timelike Curves". Tech report, CalTech GRP-340

 Not clear!  It's been argued that they're impossible (but based on the claim that something is "obviously" silly)  But they're present in solutions to Einstein's field equations (eg Gödel's universe) ... and if traversable wormholes exist...

 It's generally claimed that FTL travel would necessarily result in time travel (i.e. CTCs) being possible  We have one theory in which FTL is possible, but it doesn't lead to CTCs.  Therefore: FTL does NOT entail CTCs.

 VERSION 1 If we revisit a past event, that event is in our past, and hence fixed. We have no choice but to repeat our earlier actions. No paradoxes.  VERSION 2 We don't need to repeat earlier actions. Does this necessarily entail paradoxes? No!

In this ribbon universe, we revisit a past event, but our space and time axes have been switched over, so we cannot re- traverse the loop without travelling FTL.

Andréka et al. (2011, forthcoming)

 If a computer traverses a CTC and go back to an earlier state, how did it manage to recover its lost information?  It must be stored somewhere - in the CTC?  By considering a computation occurring in a CTC, we deduce  Either: CTCs have entropy (just like BHs)  Or: CTCs have failsafe mechansms preventing lossy computations being initiated

 We cannot say for certain whether any of the cosmological schemes is definitely feasible in our own universe. [ditto re.Turing machines]  BUT the very fact that they might be feasible suggests that basic assumptions concerning computation need to be reconsidered  We cannot simply assume that the Church- Turing Thesis extends to physical devices. The underlying structure of physics matters.

Find out more at the HyperNet 11 / Physics &Computation 2011 Workshops, at UC2011, Turku, Finland, June 2011.