Definiteness of a computational method is the property that each step of the method "must be precisely defined; the actions to be carried out must be rigorously and unambiguously specified for each case" [3]. This includes the property that it must be unambiguous which step, if any, follows the current step in any execution of the method.
Generic computational methods do not usually have the property of definiteness, since they only place certain requirements on the operations used, without necessarily pinning them down. They are defined in terms of concepts (collections of abstractions) rather than in terms of individual abstractions. When the requirements are drawn so tight that there is no ambiguity--each concept involved contains only a single abstraction--a generic computational method has the property of definiteness; we also say that it is nongeneric. Alternatively, we might have a concept containing more than one abstraction, but we achieve definiteness by selecting from it a single abstraction.
Note also that resource-constraint requirements place some limitations on just how "indefinite" the steps of a method may be.