One method in this theory is modelled as a coin-tossing Arthur and an all-knowing, but dishonest Merlin. Proofs in this theory often proceed via padding arguments. The likely existence of intermediate objects in this field was proven by Richard Ladner. In this theory, "relativization" is done by assuming the existence of an "oracle." This theory centers on measures that must satisfy the Blum axioms. In this field, radically different behavior when considering space instead of time was first demonstrated by (*) Savitch's theorem. In this field, a "diagonalization method" is used to prove the two hierarchy theorems. In this theory, the Cook-Levin theorem demonstrates the intractability of anything that can be reduced 
One method in this theory is modelled as a coin-tossing Arthur and an all-knowing, but dishonest Merlin. Proofs in this theory often proceed via padding arguments. The likely existence of intermediate objects in this field was proven by Richard Ladner. In this theory, "relativization" is done by assuming the existence of an "oracle." This theory centers on measures that must satisfy the Blum axioms. In this field, radically different behavior when considering space instead of time was first demonstrated by (*) Savitch's theorem. In this field, a "diagonalization method" is used to prove the two hierarchy theorems. In this theory, the Cook-Levin theorem demonstrates the intractability of anything that can be reduced to SAT ("sat"). For 10 points, name this theory that sorts computational problems into difficulty "classes" like P and NP.
One method in this theory is modelled as a coin-tossing Arthur and an all-knowing, but dishonest Merlin.
computational complexity theory [accept complexity classes; prompt on answers like "computation theory"; also prompt on answers like "computability theory" or "recursion theory"; anti-prompt on "interactive proof" before "padding"]