From Schneier on Security
Artificial intelligence (AI) has been billed as the next frontier of humanity: the newly available expanse whose exploration
…
B. Schneier| February 29, 2024
According to this article, in the near future LESS people will be going to college. There is even a name for this upcoming shift: The Enrollment Cliff. Why?Ishere...gasarch From Computational Complexity | February 27, 2023 at 10:10 AM
You are a college president. An online betting company says We will give you X dollars if you allow us to promote online gambling at your University.I suspecthere...gasarch From Computational Complexity | February 19, 2023 at 09:38 PM
I was looking at the paper PSPACE-Completeness of reversible deterministic systemsby Erik Demaine, Robert Hearn, Dylan Hendrickson...gasarch From Computational Complexity | February 12, 2023 at 04:22 PM
After just one round of referees reports(they send me the reports, I made the corrections, they were happy) I got email saying my paper on proving the primes are...gasarch From Computational Complexity | February 6, 2023 at 08:56 PM
Here is how history DID unfold:1) People noticed that the ratio of the circumference to the diameter of ANY circle is always the same, it's a number between 3this...gasarch From Computational Complexity | January 31, 2023 at 04:53 PM
In Dec 2021 I noted in this post, which was my 1000th post ever (according to Ken Regan, see here) that Betty White had the misfortune of dying on Dec 31, 2021,...gasarch From Computational Complexity | January 22, 2023 at 09:50 PM
When Martin Davis passed away Lance emailed me what he got from using ChatGPT to do an obit. Here it is and I also note what it got wrong.----------------------...gasarch From Computational Complexity | January 16, 2023 at 09:16 AM
As you probably already know from other sources, Martin Davis passed away on Jan 1, 2023, at the age of 94. His wife Virginia died a few hours later.He majoredOccasionally...gasarch From Computational Complexity | January 9, 2023 at 11:11 AM
The following appeared on Harry Lewis's blog, here, hence it is written in his voice, though it is a co-authored. You'll see why later. I then have some comments...gasarch From Computational Complexity | December 19, 2022 at 12:12 AM
Some people asked me to comment on FTX since I teach Crypto. My insights are no better than anyone else; however, I have wanted to do a blog post about the illogic...gasarch From Computational Complexity | December 11, 2022 at 11:03 PM
More on the information on Harry Lewis's talk is in his blog post about it:here1) On Dec 8, 2022 Harry Lewis is giving the annual Thoraf Skolem Memorial Lecture...gasarch From Computational Complexity | December 8, 2022 at 10:38 AM
There are times when NOT having computer access (is that possible anymore?) can make you MORE productive. 1) I did a lot of my Muffin Work when I was in MexicoTexas...gasarch From Computational Complexity | November 28, 2022 at 06:47 PM
(Updated version of Computational Intractability: A Guide to Algorithmic Lower Bound by Demaine-Gasarch-Hajiaghayi is here)Any question like who first though of...gasarch From Computational Complexity | November 14, 2022 at 11:18 PM
BILL: Lance, I was looking into TSP, metric TSP, Euclidean TSP since I am going to teach about P, NP, NPC, and approximating NPC problems and I came across theThe...gasarch From Computational Complexity | November 7, 2022 at 07:43 PM
David Marcus was a Math major a year ahead of my at SUNY Stonybrook (he graduated in 1979,I graduated in 1980). He then got a PhD from MIT in Math, and is a reader...gasarch From Computational Complexity | October 30, 2022 at 01:35 PM
BILL: A computer program (or an AI or an ML or whatever) found a BETTER way to do matrix mult! Its in the same spirit as Strassen. I've always wondered if Strassen...gasarch From Computational Complexity | October 27, 2022 at 07:46 AM
Tucker Bane is a friend of mine who has an AWESOME video game availablethat is called BYTE LYNX.I am curious- Can I be an INFLUENCER!Lets find out!At the link below...gasarch From Computational Complexity | October 18, 2022 at 02:02 AM
All time bounds are asymptotic and really O-of.Recall that Strassen found a clever way to multiple two 2x2 matrices with 7 mults (and lots of adds) leading tohere...gasarch From Computational Complexity | October 10, 2022 at 12:03 AM
One of the proofreaders for Computational Intractability: A Guide to Algorithmic Lower Bounds(available here)made the following objection, which raises some questions...gasarch From Computational Complexity | October 4, 2022 at 10:05 AM
RECALL:A max-problem f has a A P Time App Scheme (PTAS) if there is an algorithm ALG such that ALG(\epsilon) \ge (1-\epsilon)f(x).A min-problem f has a A P Time...gasarch From Computational Complexity | September 26, 2022 at 10:02 PM