The prolific researcher found deep connections between randomness and computation and spent a career influencing cryptographers, complexity researchers and more. For more than 40 years, Avi Wigderson ...

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 ...

In his tragically short life, Alan Turing helped define what computing machines are capable of, and where they reach inherent limits. His legacy is still felt every day, in areas ranging from ...

In the 1980s, an inkling emerged among some scientists that very disparate phenomena might on some deep level be related. The weather, protein folding, computers, evolution, the stock market, the ...

The British mathematician and pioneer of computing Alan Turing published a paper in 1936 which described a Universal Machine, a theoretical model of a computer processor that would later become known ...

Part of “Complexity Theory,” a new column on the tangled questions of our technological age. The very first introductory seminar that I was enrolled in at Stanford was CS 56N: Great Inventions and ...

As a practising computer scientist, I thought I had a fairly good grasp of Alan Turing’s many contributions to the field. But The Turing Guide, by Jack Copeland, Jonathan Bowen, Mark Sprevak and Robin ...