The original idea behind the turbo codes was to import an electronics technique into computer science. When we want to create a high-gain amplifier, we put in 2 or 3 of them in a series.

Similar analogies exist in the area of autonomous vehicles. Overall, machine learning seems to define the notion of probabilistic algorithms in computer science in a similar manner as quantum physics.

Researchers have devised a new framework for designing machine learning algorithms that helps prevent intelligent machines from being biased.

Computer scientists have written a network flow algorithm that computes almost as fast as is mathematically possible. This algorithm computes the maximum traffic flow with minimum transport costs ...

But in 2002, three computer scientists at the Indian Institute of Technology Kanpur devised an unconditional proof and a clever algorithm that finally confirmed the problem was also in P.

Known today as Karatsuba’s Algorithm, this breakthrough challenged the long-held belief that multiplying two n-digit numbers required n² steps.

One computer scientist’s “stunning” proof is the first progress in 50 years on one of the most famous questions in computer science.