Computational complexity and computability are central themes in theoretical computer science that address the fundamental question of what can be computed and at what cost. Computability theory ...

A major advance reveals deep connections between the classes of problems that computers can — and can’t — possibly do. At first glance, the big news coming out of this summer’s conference on the ...

In recent years, the Massively Parallel Computation (MPC) model has gained significant attention. However, most of distributed and parallel graph algorithms in the MPC model are designed for static ...

The historical pursuit of creating intelligent machines has culminated in the modern era of artificial intelligence. However, the efficacy of AI applications is contingent upon a nuanced understanding ...

What’s easy for a computer to do, and what’s almost impossible? Those questions form the core of computational complexity. We present a map of the landscape. How fundamentally difficult is a problem?

In this Artificial Intelligence podcast with Lex Fridman, computer scientist Donald Knuth discusses Alan Turing, Neural networks, machine learning and other AI topics from ant colonies and human ...