The All Purpose Halting Problem
March 4th, 2007I have invented a new and massively useful bit of language based on a mathematical problem. The Halting Problem is one that relates to a hypothetical computer program which may or may not enter an infinite loop, and in general, the only way to know if it will is to try it. But of course, you can’t really ever find out that it won’t finish, because no matter how long it’s been running, it could still be just about to finish. It’s a problem.
I have noticed that this phenomenon is quite common, and I think the term “Halting Problem” should be applied to all such cases. A few examples might help explain what I mean:
The Free City Bus Halting Problem
Leeds council run a free bus that runs around the city centre. At any given point, it is worth my while to wait for this bus if and only if it will arrive in the next ten minutes. But the only way to tell is by waiting, and once I’ve done that, it has become worth my while to wait up to another ten minutes. The bus may never come. It’s a problem.
The Steven Moffatt Halting Problem
Less common, this one. A friend of mine said he’d buy the DVDs of Coupling, but that he wouldn’t bother if Steven Moffatt made something new he could watch soon. But he may not. But then, he might wait and then my friend might buy the DVDs and the next day he might put out a new series. It’s a problem.
The Duke Nukem Forever Halting Problem
Duke Nukem Forever has been in development for a decade. It may never come out. Is it worth 3D Realms ditching it and cutting their losses, or should they soldier on, believing it will be released sometime before another decade has passed? They’ll never know unless they keep going, but if they do that they might work for another five years and still not know. It’s a problem.
The Monty Hallting Problem
A lot of gameshows have a mechanics whereby players slowly accumulate money, and then hilariously lose it all at once. Their ideal tactic is to keep going until just before they’d lose and then run. But they don’t know when that could be. It’s a problem.
[More Help]
3 Responses to “The All Purpose Halting Problem”
Leave a Reply
Apathy Sketchpad is proudly powered by
WordPress
Entries (RSS)
and Comments (RSS).

March 5th, 2007 at 14:08
There’s the even less common David Renwick Halting Problem where I’d purchase the entirety of Jonathan Creek on DVD, but then another Christmas special would be announced. It’s a problem.
April 11th, 2007 at 13:42
(I know this comment completely misses the point, but you may spot something wrong with my reasoning:) the Halting Problem isn’t just invoked with infinite loops–it may be possible for a simple program to generate infinite complexity, as the Mandelbrot set is generated from a simple iterative rule.
(”It may be possible” because I’m not up on this area, yet. For all I know it’s been proven possible.)
The Other Andrew, Again
Also Leeds (the novelty hasn’t worn off)
August 24th, 2008 at 19:13
And, the David Renwick Halting Problem has a new catalyst in that a Christmas Special has been announced. I’m so glad I didn’t buy the DVD box set now.
No word on Coupling though.