Professor Ian Davidson's research in the Department of Computer Science focuses on making artificial intelligence systems 'fair' and trustworthy. (Graphic by Bangon Pitipong via Getty Images) In 2017, ...

People have performed many mathematical proofs to show that a quantum computer will vastly outperform traditional computers on a number of algorithms. But the quantum ...

The exponential growth in computer processing power seen over the past 60 years may soon come to a halt. Complex systems such as those used in weather forecast, for example, require high computing ...

Joy Buolamwini is a computer scientist with a PhD in philosophy from MIT's Media Lab. She uses art and research to illuminate the social implications of artificial intelligence. She founded the ...

18-year-old Ewin Tang has proven that classical computers can solve the “recommendation problem” nearly as fast as quantum computers. The result eliminates one of the best examples of quantum speedup.

For decades, the graph isomorphism problem has held a special status within complexity theory. While thousands of other computational problems have meekly succumbed to categorization as either hard or ...

Strict ethical and professional standards should be applied to the development of algorithms with social impacts to recover public trust in the technology, according to a report by BCS, the Chartered ...

Like it or not, much of what we encounter online is mediated by computer-run algorithms — complex formulas that help determine our Facebook feeds, Netflix recommendations, Spotify playlists or Google ...