6 ms·
So Kipchoge had rotating teams of pacemakers running _before_ him, throughout the race. Each team was able to outrun Kipchoge for a short amount of time, but of
by YeGoblynQueenne 7y ago
So Kipchoge had rotating teams of pacemakers running _before_ him, throughout
the race. Each team was able to outrun Kipchoge for a short amount of time,
but of course Kipchoge himself had to keep the same pace throughout the race.
This reminded me of an episode from Terry Pratchett's Small Gods. This is
mostly from memory, but he describes an invasion of the country Ephebe where
the invasion force comes from the side of a desert considered impassable,
because no expeditionary force could carry enough provisions to make it
through the desert. The trick is that a number of expeditions have preceded
the invasion whose function was to leave caches of provisions for the actual
invasion force to use. Each expedition only has to carry enough provisions to
make it to a cache location and back and of course multiple expeditions can
deposit provisions to the same cache location, until it is sufficiently
stocked for the invading force.
It's a slow and costly process, but it gets the job done and it made me wonder
if there are algorithms like that, that can compute results otherwise
uncomputable. I'm pretty sure there are- in fact I'm pretty sure it's
something blindingly obvious that I'm missing because I'm thinking of it in
terms of runners and soldiers crossing deserts... Maybe divide and conquer
strategies, or dynamic programming?
- moopling 7y agoAnother example is rockets. Most fuel in rockets is used to propell the remaining fuel up the gravity well
- dabeeeenster 7y agohttps://en.wikipedia.org/wiki/Operation_Black_Buck https://en.wikipedia.org/wiki/Operation_Black_Buck Great example
- DevX101 7y agoThe benefit of the support runners wasn't just to help him keep pace (he could probably do this with music). They also provide a drafting help to limit any head-on air resistance.
- skrebbel 7y agoIs that significant when running?
- parsimo2010 7y agoYes, for an attempt like this where every marginal gain is necessary https://www.runnersworld.com/training/a20823445/does-drafting-help-in-running/ https://www.runnersworld.com/training/a20823445/does-draftin... Even a 1% benefit is significant, considering that he beat the 7200 second goal by just 20 seconds (0.28%).
- tonystubblebine 7y agoIt's supposed to be good for about 2% at marathon pace. I'm not quite sure how long pace makers last in a traditional marathon, but I assume at least half way. So the rotating pace makers today explain maybe 1:12 of the two minute difference to his traditional best time.
- Retric 7y agoThis is also why rockets have multiple stages. A single rocket can’t make orbital velocity with significant cargo, but a bigger rocket can get the small rocker part of the way there. It works because the second stage’s lower weight allows for smaller engines and fewer fuel tanks etc.
- z-tech 7y agoThe Tower of Hanoi!
- spiraldancing 7y agoActually sounds very similar to how the rocket equation works, too.
- Cybiote 7y agoI don't know about uncomputable but for intractable, I think, and as rco8786 has already pointed out, dynamic programming sorts of fit the bill. Similarly, this is what reinforcement learning does for search. Recursive or sequential monte carlo algorithms where states hold memory across transitions probably also fit this bill. And most generally, this is what humanity does with science, skills and knowledge. No single human could discover general relativity, but generation after generation, from the first humans who worked out how to count symbolically to the definition of a Lorentzian manifold, we've been leaving caches of knowledge for each other so each next generation could reach ever farther.
- kirlfiend_grill 7y agoSeems similar to Conway checkers. https://en.wikipedia.org/wiki/Conway%27s_Soldiers https://en.wikipedia.org/wiki/Conway%27s_Soldiers
- YeGoblynQueenne 7y agoAye, found the passage from Small Gods: Hierarchy, Vorbis said later. The Ephebians didn't think in terms of hierarchies. No army could cross the desert. But maybe a small army could get a quarter of the way, and leave a cache of water. And do that several times. And another small army could use part of that cache to go further, maybe reach halfway, and leave a cache. And another small army . . . It had taken months. A third of the men had died, of heat and dehydration and wild animals and worse things, the worse things that the desert held . . .
- jgtrosh 7y agoMaybe some kind of opportunistic prefetching if you have regular deadlines and can expect a regular complex problem deadline. But maybe concurrent threads would be easier, so this could make sense only in a super limited embedded environment.
- arctangent 7y agoI don't know for sure but I strongly suspect that Pratchett was heavily influenced by Operation Black Buck: https://en.wikipedia.org/wiki/Operation_Black_Buck https://en.wikipedia.org/wiki/Operation_Black_Buck In particular, this diagram from that page makes the process clear: https://en.wikipedia.org/wiki/Operation_Black_Buck#/media/File:Refuelling.plan.black.buck.svg https://en.wikipedia.org/wiki/Operation_Black_Buck#/media/Fi... Hopefully the name of the original mission is enough to help you find a link to some relevant mathematics :-)
- NickBusey 7y agoThat diagram is anything but “clear”.
- Someone 7y agoI find it fairly clear. - each vertical line is the flight of an airplane - each horizontal/diagonal line is a refueling operation So, planes take of from Ascension Island at the bottom, only one reaches the Falkland Islands. Ignoring the gray vertical lines (they are for ‘insurance’, in case other planes would have hit a problem), we have: - 6 Victors taking of - 3 of them refueling the other 3 after a short while (presumably because taking of and getting to flight height uses more fuel than steady flight), immediately returning to base afterwards. - the bomber taking off - a seventh Victor taking off, refueling the bomber twice, and then returning to base - one of the 3 Victors of the first wave refuels the bomber twice, then refuels another of the three before returning to base - that second one refuels the third one and returns to base Etc.
- mopsi 7y agoHere's a bit better diagram: https://i.imgur.com/LZLSlI3.jpg https://i.imgur.com/LZLSlI3.jpg Of all the aicraft that took off, only one actually flew over the target. It had to be refueled seven times on outbound journey, and the last tanker itself had to be refueled three times to fly that far.
- YeGoblynQueenne 7y agoYeah, OK, wow. That's ... complicated. And I think they didn't manage to get a very good return for all this effort, from a diagonal reading of the article. Er. Sorry, I'm being thick, but your hint about the link to the relevant maths etc went way over my head. I might be missing a cultural reference? :0
- rco8786 7y agoSounds like dynamic programming
- YeGoblynQueenne 7y agoIt kind of does. I have dynamic programming in my mind also, these days hence why I'm not sure- maybe I'm seeing dynamic programming everywhere.
- airstrike 7y agoFirst thing that comes to mind is using an HP-12c calculator and only having 4 stacks available. You can go further than a regular calculator, but only a little bit at a time so you keep chipping away at a long equation and eventually your stack collapses down into the final answer across the desert ;-)
- jacquesm 7y agoThat's how a good chunk of the arctic was discovered. Previous expeditions would go in for the sole purpose of leaving caches of foods and other useful goods.
- GauntletWizard 7y agoI've seen this problem several times expressed using camels and bananas [1] I would also think it's related to the rocket equation - with each iteration of "grab bananas, turn around" you have fewer bananas to carry with you, but it forms a parabolic curve as you need many bananas at the start of the desert, fewer as you go onwards and don't need to make trips to retrieve the bananas you've already eaten. [1]http://www.crazyforcode.com/camel-bananas-puzzle/ http://www.crazyforcode.com/camel-bananas-puzzle/
- alanbernstein 7y agoDescribed in idealized form here: https://en.m.wikipedia.org/wiki/Jeep_problem https://en.m.wikipedia.org/wiki/Jeep_problem
- waynesonfire 7y agoI don't play many video games, but when I do they tend to be military strategy games of various types. After reading your comment, it made me think if I ever deployed such a tactic in the video games that I've played and I couldn't think of a situation. I found this very interesting! Seems like an amazing dynamic to add to a video game if it were possible. Some commenters responded saying rockets have this property... but I don't know. I'm having a hard time reconciling that mere stages model this concept. Since if so, you could argue that anything that introduces a progression satisfies this condition. Maybe there is some nuance here, for example, the caches can't be directly controlled by a player.
- a_d 7y agoSolution to the Byzantine General’s Problem using proof of work is possibly an example. The basic problem is: how do you make sure that multiple entities, which are separated by distance, are in absolute full agreement before an action is taken? If one is not trying to solve it in the fastest time, then an agreed ‘truth’ can be reached after ‘some time’ without a central entity. By deciding to go ‘slow’, a solution can be found eventually.
- cynoclast 7y ago>It's a slow and costly process, but it gets the job done and it made me wonder if there are algorithms like that, that can compute results otherwise uncomputable. Oddly enough, caching? Something you couldn't possibly compute with a reasonable response time is simply cached the first time and served until it expires.
- not_kurt_godel 7y ago> It's a slow and costly process, but it gets the job done and it made me wonder if there are algorithms like that, that can compute results otherwise uncomputable The catch with certain classes (maybe/probably all? disclaimer: am not theoretical computer scientist/mathematician) of uncomputable problems is that they are such that there is no notion of "getting closer" to the solution that's analogous to traversing the desert to a known location. There is no way to verify whether the next incremental step is taking you closer to or farther from the solution because calculating such is essentially the same problem as the root problem. See https://en.wikipedia.org/wiki/Undecidable_problem https://en.wikipedia.org/wiki/Undecidable_problem
- YeGoblynQueenne 7y agoNo, you're right. I say "uncomputable" but that's not what's happening here. The problem is not "uncomputable" it's just that the result is negative (X men can't cross Y distance carrying Z provisions). Thanks for pointing this out, my bad for using "uncomputable" wrong.