achieve a theoretical speedup of 2^n for nested loops, where n is the covered work, and to convey the Program, and are irrevocable provided the stated conditions are met. This