premise: A turing machine is a simple theoritical machine that should be able to solve any problem that a more complex machine can, and hence, is used in proofs on complexity theory.
hypothesis: A complex machine is described by: it is made of more than one simple machine.