Suppose that you want to obtain a patent for an invention and, in your claims of the patent application, you recite terms as a structure with functional language or means-plus-function language.  What if this language requires an algorithm to carry out the function and you fail to disclose the algorithm in your patent application?  Can the patent claims be held indefinite for failing to disclose the algorithm?  The answer may be YES!