1. A sequential machine that solves SAT for any boolean formula of n variables and m clauses, in linear time O(m), which is independent of n; where the maximum value of n is constrained by hardware limitations.