Bill is easily amused by AI

blog.computationalcomplexity.org/2024/04/intell…

At Computational Complexity Bill Gasarch posed a challenge 'Find a non-reg lang that is not easily proven non-reg.' Meaning, the pumping lemma plus some other basic tools always seems to be sufficient. blog.computationalcomplexity.org/2017/10/open-p… Lance Fortnow

I spotted Ramanujan's bus.

Complexity theorists often ask how hard it is to solve a hard problem. Now, the problem of compressing data into simple descriptions has been made a bit easier. Ben Brubaker reports: quantamagazine.org/cryptography-t…

April's Favorite Theorem: Two quantumly entangled provers don't fool around--they can convince a polynomial probabilistic verifier that any program halts, no matter how many steps it takes.

blog.computationalcomplexity.org/2024/04/favori…

We have a new kind of comment spam--A reasonable likely AI generated comment followed by some links.

We moderate so you don't have to see it.

TIL lexicographic order is not closed under concatenation, for example ab < abc and de < ef but abde > abcef.

You do get closure in enumeration order, where x < y if |x| < |y| or |x| = |y| and x is lexicographically before y.

The Bitter Lesson by Rich Sutton from 2019 but even more bitter today.

cs.utexas.edu/~eunsol/course…

Domain knowledge initially helps in machine learning until it just gets in the way.

Bill takes on two points from Hardy
- Is math a young person's game?
- Is applied math dull?

blog.computationalcomplexity.org/2024/04/avi-wi…

My post on Avi's Turing award.

blog.computationalcomplexity.org/2024/04/avi-wi…

Avi Wigderson receives the Turing Award!

awards.acm.org/award-recipien…

The new US News Rankings of CS departments are out. Even you don't believe in them, you know you're going to look.

usnews.com/best-graduate-…

Bill remembers his Maryland colleague Rance Cleaveland. I met him briefly when he was NSF CCF director. Sad loss.

blog.computationalcomplexity.org/2024/04/rance-…

Back in 2017 I traveled west from Atlanta for a perfect eclipse and a fest at U. South Carolina.

blog.computationalcomplexity.org/2017/08/kurtz-…

This year USC celebrates the WBB championship but no eclipse and today I'm settling for 94% and Menger lecture in Chicago.

iit.edu/applied-math/a…

Moving on after next summer

linkedin.com/feed/update/ur…

Bill takes on the tough math questions

blog.computationalcomplexity.org/2024/04/a-math…

ICAIM looks like a great conference: keynote by Michael Mitzenmacher, Michael Goodrich as Program Chair, Nina Balcan and Jelani Nelson on the PC.

APRIL FOOLS! None of those people have any connection to the conference, despite its webpage. Don't submit, don't register, don't go.