WEST LAFAYETTE, Ind. — In 2019, Google claimed it was the first to demonstrate a quantum computer performing a calculation beyond the abilities of today’s most powerful supercomputers. But most of the ...

Complexity theory is a fundamental branch of theoretical computer science that categorises computational problems according to their inherent difficulty and the resources required to solve them. At ...

Theoretical Foundations of Computer Science research at Drexel University's College of Computing & Informatics (CCI) explores the mathematical foundations of computing. CCI Computer Science research ...

The biological world is computational at its core, argues computer scientist Leslie Valiant. His “ecorithm” approach uses computational concepts to explore fundamental mysteries of evolution and the ...

This course is available on the MSc in Mathematics and Computation and MSc in Operations Research & Analytics. This course is available with permission as an outside option to students on other ...

Geoffrey Hinton is one of the creators of Deep Learning, a 2019 winner of the Turing Award, and an engineering fellow at Google. Last week, at the company’s I/O developer conference, we discussed his ...

Computers are all around us. How does this affect the world we live in? This course is a broad introduction to computing technology for humanities and social science students. Topics will be drawn ...

A new theory could bring a way to make quantum algorithm development less of an accidental process, say scientists. In 2019, Google claimed it was the first to demonstrate a quantum computer ...