Recht argues OpenAI FFT result uses exact complex arithmetic with superpolynomial coefficient growth; hidden constants ~10^100 make Cooley-Tukey faster for any feasible n. Frames result as complexity-theory artifact detached from real computers, citing Morgenstern (1973) and Ailon numerical stability bounds.