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
Today, Oct 10, 2019 is William Kruskal's 100th birthday (he's dead, so no cake. Oh well.) William Kruskal was a great statistician. To honor him we have a guest...GASARCH From Computational Complexity | October 10, 2019 at 03:47 PM
Having majored in pure math I had the impression that usually the theory comes first and then someone works out something to work in practice. While this is true...GASARCH From Computational Complexity | October 7, 2019 at 09:56 AM
I am delighted to introduce youto Abhinav Deshpande, who is a graduate student at the University of Maryland, studying Quantum Computing. This will be a guest post...GASARCH From Computational Complexity | October 3, 2019 at 03:41 PM
Richard Guy is a mathematician. He co-authored the classic book Winning Ways for your Mathematical Plays with Elywn Berlekamp and John Conway.
On Sept 30 (today)...GASARCH From Computational Complexity | September 30, 2019 at 08:03 PM
Sitting around with three faculty we had the following conversation
ALICE: When I applied to grad school in 1980 they saw a strong math major (that is, I had good...GASARCH From Computational Complexity | September 23, 2019 at 09:20 AM
I am teaching cryptography this semester for the second time (I taught it in Fall 2019) and will soon tell the students about the paper from 2015:
Imperfect Forward...GASARCH From Computational Complexity | September 16, 2019 at 09:10 AM
This post is non-partisan, but in the interest of full disclosure I disclose that I will almost surely be voting for the Democratic Nominee. And I say almost surely...GASARCH From Computational Complexity | September 13, 2019 at 11:12 AM
Recall:
A is a tally set if A ⊆ 1*.
A is a sparse set if there is a polynomial p such that the number of strings of length n is ≤ p(n).
If there existsthis...GASARCH From Computational Complexity | September 9, 2019 at 10:55 AM
In my last post I noted that if I am asked (since I am a CS prof)
Can you fix my iphone
is
No, I work on the math side of CS
Some readers emailed me (I told...GASARCH From Computational Complexity | September 3, 2019 at 10:56 AM
When I meet non-math people and tell them I am a computer science professor I get a range of responses. Here are some and my responses.
1) Are you a math genius...GASARCH From Computational Complexity | August 25, 2019 at 01:39 PM
In Samuel Wagstaff's excellent book The Joy of Factoring (see here for a review) there is a discussion towards the end about why factoring algorithms have not made...GASARCH From Computational Complexity | August 7, 2019 at 03:27 PM
BILL: Darling, guess who is soon going to be on the Bank of England 50 pound note?
DARLING: Alan Turing.
BILL: How did you deduce that? (She is right, see here...GASARCH From Computational Complexity | July 28, 2019 at 08:46 PM
(This is a joint post with David Marcus. You'll see why later.)
In a prior I posed two infinite hat problems. Today I post the solutions. Actually this is a....GASARCH From Computational Complexity | July 21, 2019 at 11:00 PM
(I will post the solution to the problem in the last blog later in the week---probably Thursday. Meanwhile, enjoy these thoughts from Samir Khuller on the TCShere...GASARCH From Computational Complexity | July 16, 2019 at 07:38 PM
This is a joint post with David Marcus. You will see how he is involved in my next post.
Two infinite hat problems based on one scenario. I am also curious if...GASARCH From Computational Complexity | July 14, 2019 at 11:12 PM
(Joint Post with David Marcus who was a classmate of mine at SUNY Stony Brook [now called Stony Brook University]. I was class of 1980, he was class of 1979. We...GASARCH From Computational Complexity | July 7, 2019 at 11:55 PM
My father was a High School English teacher who did not know much math. As I was going off to college, intending to major in math, he gave me the following sage...GASARCH From Computational Complexity | June 30, 2019 at 10:34 PM
(title of this blog is due to Henry Baker who posted an article about this elsewhere)
Amoeba finds approx solution to TSP in linear time:here.
Over the yearshere...GASARCH From Computational Complexity | June 24, 2019 at 01:03 AM
In my post about the Nevanlinna prize name change (see here) one of my readers raised a different question about the prize:
BEGIN QUOTE
So there's one of...GASARCH From Computational Complexity | June 17, 2019 at 08:59 PM
Ray Miller, one of the founders of our field, passed away recently at the age of 90.
He has associations with both GA Tech and The University of Maryland, so both...GASARCH From Computational Complexity | June 8, 2019 at 02:35 PM