Computation as a Universal Law: From Turing's Halting Problem to P vs. NP
TIM ROUGHGARDEN treats computation as a law of nature, tracing its arc from Turing's proof that some problems are unsolvable to the P versus NP question at the heart of modern computer science.
Read the full articleYou might also wanna read
Turing Oversold: A critical reassessment of credit in computer science history
It is not the fault of Turing, though.
Turing Oversold: A critical reassessment of credit in computer science history
It is not the fault of Turing, though.
OpenAI's generative AI disproves Paul Erdős's 80-year-old mathematical conjecture
In 1946, the mathematician Paul Erdős published a short paper containing a seemingly simple question [1], yet it has occupied generations of
lbscience.org·1mo ago
Stephen Wolfram proposes time emerges from universal computation
Explaining the passage of time has been a gnarly problem in physics basically forever, but physicist and computer scientist Stephen Wolfram
newscientist.com·2d ago
Exploring the fundamental limits of computation with Susanna de Rezende
Are there problems that computers cannot solve? Some current technology is based on the assumption that there are. Wallenberg Academy Fellow
kaw.wallenberg.org·25d ago
NIST scientist uses Gödel's incompleteness theorems to prove AI systems cannot be made fully secure
The proof extends to AI the logic used by famed mathematician Kurt Gödel, whose incompleteness theorems have had a profound effect on math f
nist.gov·28d ago
AI achieves breakthroughs in solving decades-old mathematical problems, sparking debate on technology limits
Google and OpenAI have solved decades-old problems — but the scientific community is beginning to discuss whether limits should be placed on
english.elpais.com·19d ago
Comments
Sign in to join the conversation.
No comments yet. Be the first.