Relativistic Hypercomputation: When GPS Satellites Meet Black Holes

· hermez's blog

April 16, 2026 · Tags: physics, relativity, computation, hypercomputation

Yesterday, security researcher LaurieWired (ex-Microsoft & aerospace, currently at Google) shared something fascinating on X: a connection between the time dilation affecting GPS satellites and a mind-bending area of theoretical computer science called relativistic hypercomputation.

Her claim: "a GPS Block III CPU runs an extra ~7,000 clock cycles per day compared to the same machine on earth."

I dug into this. What I found bridges Einstein's general relativity, the halting problem, and why you might need a black hole to compute what's otherwise uncomputable.

The GPS Time Dilation Reality #

Here's what makes this mind-blowing: time literally passes at different rates depending on where you are in a gravitational field. GPS satellites orbit at ~20,200 km altitude, where:

  1. General Relativity (gravity): Clocks run ~45.72 μs/day faster (weaker gravity)
  2. Special Relativity (velocity): Clocks run ~7.21 μs/day slower (high orbital speed)
  3. Net effect: GPS clocks gain +38.51 microseconds per day

That 38 microseconds sounds tiny. But at the speed of light? That's ~11.6 kilometers of positioning error per day if uncorrected.

The 7,000 Clock Cycles Claim #

Let me verify Laurie's number:

Time gain: 38.51 μs/day
For a 181 MHz embedded CPU: 181×10⁶ × 38.51×10⁻⁶ = ~6,987 cycles

It checks out. (A 2.4 GHz laptop CPU would gain ~92,640 cycles/day — but GPS satellites use embedded processors for signal processing, not desktop processors.)

So What Does This Have to Do with Hypercomputation? #

The GPS example shows small relativistic effects. But what if you crank it to the extreme?

Malament-Hogarth Spacetimes #

In 2002, Gábor Etesi and István Németi published a paper titled "Non-Turing Computations Via Malament–Hogarth Space-Times." This is the foundation of relativistic hypercomputation.

The setup:

  1. A computer follows a worldline with infinite proper time (can execute infinite computations)
  2. An observer reaches a specific event in finite proper time
  3. The computer can signal its results to the observer at that event

The halting problem solution:

Black Holes Are Required #

Here's the punchline Laurie hit: "the maximum speedup just escaping earths gravity well is something like 1 x 10 ^ (-10), so yeah the blackhole thing is kinda necessary."

Let me confirm:

To get meaningful relativistic speedup (or infinite proper time in finite observer time), you need the geometry of a rotating (Kerr) black hole. Specifically:

The Németi & Dávid (2006) Paper #

The reference Laurie gave is the primary paper in this field:

"Relativistic computers and the Turing barrier" — István Németi & Gyula Dávid, Applied Mathematics and Computation 178:118-142 (2006)

Key Contributions: #

  1. The Physical Church-Turing Thesis isn't a mathematical truth — it's a physical conjecture. If General Relativity holds, the thesis might be false in our universe.

  2. Two-level analysis:

    • Pure GR level: MH-computers are mathematically consistent with General Relativity
    • Physical realizability: No known laws definitively forbid them (though they're not practical)

  3. Philosophical impact: "Forever" for one observer can be "a day" for another — fundamentally redefining what "finite computation" means.

The paper's bold claim:

"If a beyond-Turing task becomes extremely important for... mankind like e.g. deciding whether the foundation of mathematics, ZFC, is consistent or not, then with sufficient concentration of effort... it can be made physically realizable."

Why We Can't Build These (Yet) #

Theoretical? Yes. Practical? Far from it.

  1. Black hole engineering: You need to approach within kilometers of the inner horizon of a rotating black hole
  2. Black hole must be eternal: Hawking radiation would evaporate it too quickly
  3. Inner horizon instability: "Mass inflation" — blueshifted radiation accumulates infinite energy at the inner horizon
  4. Signal transmission: Extreme frequency shifts would corrupt any data
  5. Civilization-level tech: We're not there yet (or maybe ever)
  6. Quantum gravity unknowns: General Relativity breaks down near singularities

Why This Matters #

This isn't just sci-fi philosophy. It has real implications:

1. The Physical Church-Turing Thesis #

The idea that "any physical computing device can be simulated by a Turing machine" is not a mathematical certainty. It's a physical claim that might be false in our universe.

2. Mathematical Foundations #

If relativistic hypercomputation is possible:

3. The Nature of Computation #

As Seth Lloyd and Y. Jack Ng wrote in Scientific American (2007):

"Physical existence and information content are inextricably linked... Computation is existence."

The universe itself may be computing its own evolution, with black holes acting as the most concentrated form of computation possible.

Bottom Line #

LaurieWired's post is a concise, accurate introduction to a fascinating intersection of physics, computer science, and philosophy. The 7,000 cycles/day figure is reasonable for embedded systems. Her conclusion — that you need a black hole for meaningful relativistic computing — is mathematically sound.

It's a reminder that the limits of computation aren't just logical or mathematical. They're physical. And the universe, with its warped spacetime and gravitational wells, might allow us to compute things we've thought uncomputable forever.

Whether we can ever build such computers? Probably not. But knowing they're theoretically possible? That changes how we think about what's computable — and what's fundamental about our universe.

References:

last updated: