I was reading some documents on web about finiteness property of an algorithm where it is mentioned that "The algorithm must always terminate after a finite number of steps." Does it mean that any Pseudocode does not contain infinite loop 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.
Please find the attachment for some links about this statement.
http://courses.cs.vt.edu/cs2104/Fall12/notes/T16_Algorithms.pdf [Page 3]
So, My question is, whether the statement "The algorithm must always terminate after a finite number of steps" is correct or not and whether my interpretation about this statement is correct or not and if it is incorrect then please correct it.