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
(INNOVATIONS CONFERENCE:
here)
(While preparing this two other bloggers wrote on the same topic,
Scott here
and Lipton/Regan
here.
Our slogan: Complexity Blog...GASARCH From Computational Complexity | November 30, 2011 at 08:17 PM
Consider the following email I got:
Dear Professor,
1. Antarctica Journal of Mathematics
2. ArchimedesJournal of Mathematics
3. BesselJournal of Mathematics...GASARCH From Computational Complexity | November 16, 2011 at 03:41 PM
A while back GASARCH
solicited responses to a P vs NP poll
and gave Oct 31 as the deadline. Now that the deadline is passed
I post my answers.
Does P=NP? IIf...GASARCH From Computational Complexity | November 11, 2011 at 06:23 PM
Mission Impossible
was my favorite show as a kid. As an adult it would not make my
top 20, and I wonder why I liked it so much as a kid.
(Actually I do know- at...GASARCH From Computational Complexity | October 19, 2011 at 02:24 PM
A more nuanced view of Steve Jobs:
here.
A less nuanced view of Steve Jobs:
here.
The next Steve Jobs:
here
A very nice NON-Steve Jobs post
here.
Is thisAndrew...GASARCH From Computational Complexity | October 12, 2011 at 05:23 PM
What do you do if you read a paper or book and find mistakes in it?
My first impulse is to say:
Email the author. Always be polite and admit (which is true) that...GASARCH From Computational Complexity | October 5, 2011 at 05:56 PM
In a
prior post
I wrote that the Erdos-Turan Conjecture
should be a Millennium problem.
Today I am going to (1) suggest a generalization of the Erdos-Turan Conjecture...GASARCH From Computational Complexity | September 28, 2011 at 02:47 PM
(Joint post by Bill Gasarch and Daniel Apon)
Recently I (Daniel) reviewed Dexter Kozen's
Theory of Computation (it was AWESOME).
You can find the review
here...GASARCH From Computational Complexity | September 21, 2011 at 02:01 PM
Why is
a1/2 = sqrt(a)?
true?
To make the rule
ax+y=ax a y
work out.
Why is
(∀ x ∈ ∅)[P(x)]
true?
To make the rule
(∀ x ∈ A ∪ B)[P(x)] iff (∀ x ∈ A)[P(x)]...GASARCH From Computational Complexity | September 14, 2011 at 02:12 PM
(Samir Khuller Guest Post.)
On Conference Locations:
I recently looked at Orbitz for fares to Japan for SODA 2012 in Jan. The
round trip fare from DC to...GASARCH From Computational Complexity | September 9, 2011 at 05:46 PM
When I posted on sequence problems
here
some people said that they did not have unique answers.
Many problems FORMALLY do not have a unique answer, but common sense...GASARCH From Computational Complexity | September 7, 2011 at 11:58 PM
(FOCS registration is open:
here.
Note that there are tutorials on Sat Oct 22 and the conference talks are
Sun Oct 23-Tues Oct 25.)
(Guest post by By Jeffery...GASARCH From Computational Complexity | September 6, 2011 at 02:29 PM
During Hurricane Irene I lost power for about 18 hours.
I was actually pleased how short this was. PEPCO (my power company)
did not tell us when power would beprior...GASARCH From Computational Complexity | August 31, 2011 at 03:08 PM
Grad students often wonder how people get ideas of things to work on.
The usual advice I give is
(1) go to talks,
(2) read papers,
(3) talk to people,
(4) follow...GASARCH From Computational Complexity | August 23, 2011 at 02:55 PM
B. Cook, Podelski, and Rybalchenko have done both practical and theoretical
work on proving that programs terminate.
They use Ramsey's Theorem (Yeah!). Jon Katz...GASARCH From Computational Complexity | August 15, 2011 at 04:13 PM
In my discrete Math course I asked the following question:
For each of the following sequences find a simple function a(n) such
that the sequence is a(1), a(2)...GASARCH From Computational Complexity | August 8, 2011 at 01:52 PM
Since Lance is not tweeting this week, I will take up the slack.
So, here is my once-in-a-while post
If I tweeted AND if tweets didn't have to be so short, here...GASARCH From Computational Complexity | August 3, 2011 at 02:40 PM
WRITTEN AUG 1,2011:
It has been said that simple innovative ideas to not get into STOC/FOCS and only
hard technical improvements do. This is one of the motivations...GASARCH From Computational Complexity | August 1, 2011 at 02:18 PM
In my
post about the myth that Logicians are crazy
I mentioned in passing that Whitehead and Russell spend 300 pages
proving 1+1=2 (but were both sane). Two people...GASARCH From Computational Complexity | July 25, 2011 at 02:23 PM
I am looking for reviewers for the following books for my
SIGACT NEWS book review column.
I will try to edit this post to keep the list up to date;
however, ifthis...GASARCH From Computational Complexity | July 20, 2011 at 02:09 PM