Sticking to the supposition of this puzzle creates confusion. The only possible solution is to look at it differently, not being hypnotized by 1/2, 1/4, ..... But I accept that it is your choice. — Ludwig V
Combined with another premise, it yields a paradox.
Thomson outlines the paradox:
Premise 1. To compete the main task requires completing infinitely many subtasks.
Premise 2. Infinitely many subtasks cannot be completed.
Conclusion. The main task cannot be completed.
But the main task can be completed. So one of the premises must be false.
One may say that Premise 1 is false. But that is a kind of "jumping the gun" when we would want to examine whether Premise 2 is false and Premise 1 is true. To say that Premise 1 is false on the grounds that it yields a falsehood skips that it's not Premise 1 alone that yields a falsehood, but rather it's the conjunction of Premise 1 and Premise 2 that yields a falsehood.
So Thomson does not right away say that it is Premise 1 that is false but rather he examines arguments for and against both premises.
Also Thomson argues:
"It is conceivable that each of an infinity of tasks be possible (practically possible) of performance [...] To deny [that] is to be committed to holding what is quite absurd, that for any given kind of task there is a positive integer k such that it is conceivable that k tasks of the given kind have been performed, but inconceivable, logically absurd, that k + 1 of them should have been performed."
That is, if there is a finite upper bound to how many times division can be executed, then there is some finite number k such that division can be executed k number of times, but division cannot be executed k+1 number of times. But why? Again, it's a leap to say that the answer is that otherwise there would be the false conclusion of the paradox, as the false conclusion might stem from the other premise of the paradox. Also, keeping in mind that Thomson is not arguing about the fact of the matter as to divisions of whatever, but rather about conceivability.
And I would consider that it's reasonable that the problem need not be contained to what happens to be true or false per some theory of physics, but rather that the problem of tasks may be abstract so that we may wish to resolve the paradox while granting the logical possibility or logical impossibility of the premises.
And Thomson's first point is one of logic, whatever the truth of falsity of the premises:
It is incorrect to infer that infinitely many tasks may be completed in finite time from the premise that there is no finite upper bound to how many task may be completed in finite time. I would put it this way: For for any finite number of tasks, there may be a completion of all the tasks. But that does not imply that there may be a completion of all of infinitely many tasks.
The difficulty is, I think, the assumption that "divide" means exactly the same thing in all contexts — Ludwig V
Who makes that assumption?
not understanding that infinity means endless (but not necessarily limited) — Ludwig V
There are different philosophical notions of infinity. But I don't know what specific approach to the paradoxes you think depend on a certain notion of infinity that, on its own terms, carries a misunderstanding. At least in context of mathematics that is mentioned in the puzzles, we have definitions:
S is finite if and only if there is a 1-1 correspondence between S and some natural number.
S is infinite if and only if S is not finite.
S has an upper bound in S if and only if there is a member of S that is greater than or equal to all members of S.
S has an upper bound if and only if there is an x such that x is greater than or equal to every member of S.
S has a lower bound in S if and only if there is a member of S that is less than or equal to every member of S.
S has a lower bound if and only if there is an x such that x is less than or equal to every member of S.
g converges to L if and only if for any d, there is an n such that for all k greater than or equal to n, |g(k) - L| is less than d.
If g converges to L, the L is the limit of g.
So, regarding the infinite sequences in Thomson's lamp problem:
The range of the sequence 1, 2, 3 ... has no upper bound in the range, but it has an upper bound as far as ordinals go (the least upper bound is wu{w}).
The sequence 1, 2, 3 ... does not converge.
The range of the sequence 1, 1/2, 1/4 ... has no lower bound in the range, but it has a lower bound (the greatest lower bound is 0).
The sequence 1, 1/2, 1/4 ... converges to 0.
The range of the sequence 1, 0, 1 ... has an upper bound and a lower bound in the range.
The sequence 1, 0, 1 ... does not converge.
Those are just the ordinary mathematical definitions, which (in some sense) we don't evaluate as true or false but rather they're just stipulative definitions, and as such, they don't carry any "misunderstandings".