acm-header
Sign In

Communications of the ACM

Blogroll


Refine your search:
dateMore Than a Year Ago
authorRJLipton+KWRegan
bg-corner

From Gödel's Lost Letter and P=NP

Goldilocks Principle And P vs. NP

The rule of three Wikimedia Commons source Robert Southey was the Poet Laureate of Britain from 1813 until his death in 1843. He published, anonymously, “The Story...

From Gödel's Lost Letter and P=NP

A Great Solution

A great conjecture too Alternate photo by Quanta Thomas Royen is a retired professor of statistics in Schwalbach am Taunus near Frankfurt, Germany. In July 2014...

From Gödel's Lost Letter and P=NP

Theory Fest—Should You Go?

Theory Fest—Should You Go? Boaz Barak and Michael Mitzenmacher are well known for many great results. They are currently working not on a theory paper, but on a...

From Gödel's Lost Letter and P=NP

The End Of Human Science?

Could we go the way of telegraph operators? Pixabay source Lofa Polir has sent us some new information that will have widespread ramifications for math and theory...

From Gödel's Lost Letter and P=NP

Gender Bias: It Is Worse Than You Think

q Science meets bias and diversity Deborah Belle is a psychology professor at Boston University (BU) who is interested in gender differences in social behavior....

From Gödel's Lost Letter and P=NP

Is Computer Security Possible?

The breaks keep on coming… Holly Dragoo, Yacin Nadji, Joel Odom, Chris Roberts, and Stone Tillotson are experts in computer security. They recently were featured...

From Gödel's Lost Letter and P=NP

Raymond Smullyan, 1919–2017

Serious work amid the puzzles and jokes. Amazon source When Raymond Smullyan was born, Emanuel Lasker was still the world chess champion. Indeed, of the 16 universally...

From Gödel's Lost Letter and P=NP

How to Check a Proof

What to do about claims of hard theorems? Cropped from source Shinichi Mochizuki has claimed the famous ABC conjecture since 2012. It is still unclear whether or...

From Gödel's Lost Letter and P=NP

Snow And Theory

The 25th Anniversary of the ACO Program Cropped from src1 & src2 in gardens for karma Prasad Tetali and Robin Thomas are mathematicians at Georgia Tech who are...

From Gödel's Lost Letter and P=NP

Babai’s Result: Still a Breakthrough

Even after today’s retraction of quasi-polynomial time for graph isomorphism Cropped from source László Babai is famous for many things, and has made many seminal...

From Gödel's Lost Letter and P=NP

Hunting Complexity in Zeta

A second look at Voronin’s amazing universality theorem Anatoly Karatsuba and Sergei Voronin wrote a book on Bernhard Riemann’s zeta function. The book was translated...

From Gödel's Lost Letter and P=NP

Thanks

Theorems and Proofs—which are more important? src Ken and I wish to thank all who read and follow us. May you have a wonderful day today all day. But we would like...

From Gödel's Lost Letter and P=NP

Halloween Math Style

The top scariest possible results Head chopped from source Washington Irving was a famous writer of the early 1800’s who is best known for his short stories. The...

From Gödel's Lost Letter and P=NP

Going For Two

Some football wisdom from Dick Karp Cropped from S.I. Kids source John Urschel is a PhD student in the Applied Mathematics program at MIT. He has co-authored two...

From Gödel's Lost Letter and P=NP

Why Is Being Truthful A Good Thing?

In the context of stable matching problems Jamie Morgenstern is a researcher into machine learning, economics, and especially mechanism design. Today Ken and I...

From Gödel's Lost Letter and P=NP

Congratulations, Noam

The winner of the 2016 ACM-IEEE Knuth Prize Coursera source Noam Nisan has been one of the leaders in computational complexity and algorithms for many years. He...

From Gödel's Lost Letter and P=NP

A Creeping Model Of Computation

Local rules can achieve global behavior Sarah Cannon is a current PhD student in our Algorithms, Combinatorics, and Optimization program working with Dana Randall...

From Gödel's Lost Letter and P=NP

A Proof Of The Halting Theorem

Toward teaching computability and complexity simultaneously Computing Large Numbers source Wilhelm Ackermann was a mathematician best known for work in constructive...

From Gödel's Lost Letter and P=NP

How Hard, Really, is SAT?

A new longest computer proof makes us wonder about things from security to the Exponential Time Hypothesis Marijn Heule, Oliver Kullmann, and Victor Marek are experts...

From Gödel's Lost Letter and P=NP

Descending Proofs Into Algorithms

A way to make indirect reasoning more palpable Wikimedia Commons source Nicholas Saunderson was the fourth Lucasian Professor at Cambridge, two after Isaac Newton...
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account