How difficult is it to evaluate a first-order formula in a (finite) structure? Starting from this question, we introduce some of the central notions of parameterized complexity. Moreover, we present machine characterizations of some of its complexity classes.