 This is one way to see that EXPSPACE ⊆ 2-EXPTIME, since an alternating Turing machine is at least as powerful as a deterministic Turing machine.2-EXPTIME is one class in a hierarchy of complexity classes with increasingly higher time bounds.The class 3-EXPTIME is defined similarly to 2-EXPTIME but with a triply exponential time bound formula_2.