cd /news/artificial-intelligence/faster-fourier-transform · home › topics › artificial-intelligence › article
[ARTICLE · art-147189] src=johndcook.com ↗ pub= topic=artificial-intelligence verified=true sentiment=↑ positive

Faster Fourier Transform

OpenAI posted a paper claiming an algorithm can compute the discrete Fourier transform in O(n (log n)^(1 − ε)) time for ε = 10^−13, a marginal asymptotic improvement over the Fast Fourier Transform's O(n log n). The Fast Fourier Transform remains the standard method for computing the discrete Fourier transform of a sequence of length n.

by read1 min views1 publishedOct 7, 2026

The Fast Fourier Transform (FFT) algorithm can compute the discrete Fourier transform of a sequence of length n in time O(n log n). OpenAI recently posted a paper saying there is an algorithm that could compute the discrete Fourier transform in O(n (log n)1 − ε) time for ε = 10−13. This result is amazing. It seemed that […]

The post

source & further reading
johndcook.com — original article Irrationality exponent of π What counts as a large cosine similarity? AI is an intelligence multiplier
── more in #artificial-intelligence 4 stories · sorted by recency
── more on @openai 3 stories trending now
sponsored brought to you by zahid.host 4,200+ EU-deployed projects
reading about agents? ship yours in a single git push.

Run your AI side-project on zahid.host

EU-based hosting, git-push deploys, automatic HTTPS, no cold starts. Free tier with a custom domain — perfect for shipping the agent you just read about.

$git push zahid main
→ Live at https://your-agent.zahid.host ✓
Get free account → Pricing
from €0/mo · no card required
LIVE [news/faster-fourier-trans…] indexed:0 read:1min 2026-10-07 · —