This is Thomson's lamp paradox, except the question in this case will be "was the last number odd or even?" — Michael
I suggested there are two criteria for "having finished a task":
(1) Having performed the last step;
(2) Having performed all of the steps, in some specified order.
For finite tasks, these are the same: "last" can just be defined as "all but one have already been performed."
But what about infinite tasks?
I see your argument as something like this:
1. If you have recited all the members of a set, there is some member of the set that is the last one you recited.
2. Zeus has recited the natural numbers in order. At step n, he recited the natural number "n".
3. By (1) and (2), there is a natural number z that was the last one Zeus recited.
4. By (2) and (3), z is the largest natural number.
5. Since there is no largest natural number, (2) is false.
I'm questioning step (5). We have the option of discarding premise (1) instead of (2).
Look at how criterion (1) works with finite tasks. Each time you perform a step, the number of steps remaining to be performed is one smaller. You're done when that number is 0. But this is just not true for infinite tasks. The number of natural numbers remaining to be recited is the same after reciting any finite number.
In fact, it looks to me like (1) is derivative of (2). We need a closer look at what it means to specify a task.
Suppose I give you a jar of marbles and tell you to count them. I come back half an hour later to find you haven't even started. Your explanation is that I didn't tell you what order to count them in. Fine. I know order doesn't matter, but evidently you don't, so I instruct you to pick one, take it out of the jar, add 1 to your running total, then pick any remaining marble as the next one. Go on until there are no marbles left.
Is it reasonable now to say you cannot count the marbles because I didn't tell you which one is the last one? No, of course not, because my recursive specification is enough. Here's how to start; here's how to continue; here's how to know when you're done.
It might be useful to consider a similar scenario. Zeus counts backwards to 1, getting slower as he counts. It took him 1 second to count from 2 to 1, half a second to count from 3 to 2, and so on. — Michael
I think we could play around with "first" as I have been with "last", but for many cases recursive specifications are exactly what we want, so I can just as well say that what you describe here is not a task at all.
I think these calculus solutions are just a bewitchment — Michael
I think if there's an intuition pump in the room, it's not calculus but Thompson's lamp.
I think it could be that some tasks we specify by specifying the last step -- maybe that's all we care about and are indifferent about what steps are or aren't taken. Really that seems more like a direction just to bring about a certain state of affairs.
But some tasks we naturally specify using recursion, and the infinite tasks we're talking about are clearly that kind. (Counting all the marbles is not the same as making the jar empty; the jar being empty is just how you know you're done.)
So is there an argument for (1), or an argument that it is not just a special case of (2)?