Sometimes a visually compelling metaphor is all you need to get an otherwise complicated idea across. In the summer of 2001, a Tulane physics professor named John P.
Computational complexity and equilibrium analysis form an interrelated field at the crossroads of theoretical computer science and game theory. Researchers in this area investigate the intrinsic ...
A concept developed for computer science could have a key role in fundamental physics — and point the way to a new understanding of space and time. When physicist Leonard Susskind gives talks these ...
In computational complexity theory, P and NP are two classes of problems. P is the class of decision problems that a deterministic Turing machine can solve in polynomial time. In useful terms, any ...
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 ...
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 ...
Computational neuroscientists taught an artificial neural network to imitate a biological neuron. The result offers a new way to think about the complexity of single brain cells. Our mushy brains seem ...
Some computers are easy to spot. Artificial, human-built computers like those found in smartphones and laptops are abstract ...
Our research area encompasses the study of computation, computational models, computational complexity, algorithm design, algorithm verification, combinatorial optimization, computational biology and ...
Our era is defined by a constant flow of information. Data from smartphones, wearables and environmental sensors, connected to sharing and analysis platforms, accompany us daily, creating a digital ...
One of the biggest prizes in maths has been awarded to two people for their “foundational contributions to theoretical computer science and discrete mathematics”. László Lovász at the Alfréd Rényi ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results