We study the computational power of machines that specify their own acceptance types, and show that they accept exactly the languages that ≤ m -reduce to NP sets. A natural variant accepts exactly the languages that ≤ m -reduce to P sets. We show that these two classes coincide if and only if P = P, where the latter class denotes the sets acceptable via at most one question to #P followed by at...

The improved next-to-next-to-leading order (NNLO) QCD analysis of the experimental data of the CCFR collaboration for the xF 3 structure function is made. Theoretical ambiguities of the NNLO ts are estimated by means of the Pad e resummation technique. The NNLO and the new N 3 LO s (Q 2) MS-matching conditions are used. In the process of the ts we are taking into account the the twist-4 1=Q 2-t...