The system's semi-Markov decision model has infinite action sets for the positive states.
The MagicScroll's scroll wheel allows for infinite scroll action for quick browsing through long lists.
An infinity machine is a machine that can carry out an infinite number of actions in a finite time.
A hypertask is a non-numerable infinite sequence of actions or operations carried out in a finite interval of time.
When we get to instant t* = 1 P.M. we will have carried out an infinite sequence of actions, that is, a supertask T = (a1, a2, a3, …, an, … ).
Therefore, a supertask which is not a hypertask will be a numerable infinite sequence of actions or operations carried out in a finite interval of time.
When we get to instant t* = 1 P.M. the machine will have carried out an infinite sequence of actions, that is, a supertask T = (a1, a2, a3, …, an, … ).
A supertask may be defined as an infinite sequence of actions or operations carried out in a finite interval of time.
This principle affords us a rigorous demonstration of what, in any event, was already plausible and intuitively 'natural': that after having performed the infinite sequence of actions (a1, a2, a3, …, an, … ) Achilles will have reached point B (x = 1).
Let us suppose that some machine M accomplishes a bifurcated supertask in such a way that the infinite sequence of actions involved happens in a finite interval of an observer O's proper time.
