A claim recites 'means for calculating a delivery route' in a computer-implemented system. The specification says only that 'a general-purpose processor calculates the route' and discloses no algorithm. What is the most appropriate rejection?
Answer: Under 112(b), for lack of a disclosed algorithm. For a 112(f) limitation implemented by a computer, the corresponding structure is the general-purpose computer programmed to perform a disclosed algorithm. Without an algorithm, the claim lacks corresponding structure and is indefinite under 112(b); it may also lack written description under 112(a) (MPEP 2181(II)(B), 2185). Why not the others: - 102: known processors do not address the missing algorithm. - A processor is enough: a bare general-purpose computer is not adequate structure for a specialized function. - 112(d): that concerns dependent claims failing to further limit. - Only 101: eligibility may also be analysed, but it does not cure the missing structure under 112. Rule: Computer-implemented 112(f) limitations require a disclosed algorithm, or the claim is indefinite. Source: MPEP § 2181, § 2185 (9th ed., Rev. 01.2024); 35 U.S.C. 112(b), 112(f); as at Oct 2026
Accepting 'a processor' as the structure for any computer function.
Practice more Patent bar Written description, enablement and claims (35 U.S.C. 112) questions
Exam-style questions with worked answers, then full timed mocks. Free to start.
Build a daily practice habit — a few exam-style questions a day, with worked answers. Free to start.
Start practicing →Original study material written from the MPEP; not a question from the current exam.Independent. Not affiliated with or endorsed by the USPTO. Verify figures and rules against current guidance before relying on them.