Subcreative sets, introduced by Blum, are known to coincide with the effectively speedable sets. Subcreative sets are shown to be the complete sets with respect to S-reducibility, a special case of Turing reducibility. Thus a set is effectively speedable exactly when it contains the solution to the halting problem in an easily decodable form. Several characterizations of subcreative sets are given, including the solution of an open problem of Blum, and are used to locate the subcreative sets with respect to (...) the complete sets of other reducibilities. It is shown that q-cylindrification is an order-preserving map from the r.e. T-degrees to the r.e. S-degrees. Consequently, T-complete sets are precisely the r.e. sets whose q-cylindrifications are S-complete. (shrink)

I TACKLE THE LIMITED QUESTION WHETHER THERE IS AN APPROPRIATE PROCEDURE FOR SUPPORTING (VIOLATION) MIRACLE CLAIMS. I DON’T ASK WHETHER THAT PROCEDURE WARRANTS BELIEF IN MIRACLES. RELYING ON VARIOUS REQUIREMENTS FOR RATIONALLY ADVANCING A (VIOLATION) MIRACLE CLAIM, I URGE THAT G ROBINSON IS WRONG IN MAINTAINING THAT MIRACLE CLAIMS ARE A "MATTER OF WHIM"; RATHER THEY RELY ON A DEFINITE METHOD. FURTHER I URGE THAT M DIAMOND IS WRONG IN MAINTAINING THAT MIRACLE CLAIMS BRING BOTH SCIENTIFIC INQUIRIES TO A PREMATURE (...) END AND SCIENTIFIC AUTONOMY UNDER THREAT; RATHER MIRACLE CLAIMS PRESUPPOSE THOROUGH AND UNIMPEDED SCIENTIFIC INQUIRIES. (shrink)