I was reading about the finiteness property of an algorithm where it is mentioned that
the algorithm must always terminate after a finite number of steps.
Does this mean that any pseudo-code cannot contain infinite loops or it should be equivalent to Halting Turing Machine. I don't know whether the statement about finiteness property of an algorithm is correct or not. I have not found any reliable source for it and I have not read it in CLRS.
My question is whether the statement and whether my interpretation about it is correct:
An algorithm must always terminate after a finite number of steps