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
While I was working on this post another blogger posted on the same topic
here and
I found a book review of
Logicomix
that touched on some
of the same issues
here...GASARCH From Computational Complexity | July 18, 2011 at 02:45 PM
(This is a guest post by Nadia Jones who blogs at
online college
about education, college, student,
teacher, money saving, movie related topics.
You can reach her...GASARCH From Computational Complexity | July 15, 2011 at 05:39 PM
This post takes an
idea of Dick Lipton's
in a slightly different direction.
ω(G) is the size of max clique in G.
Recall that, for all 0 < δ1 < δ2 < 1,
the...GASARCH From Computational Complexity | July 14, 2011 at 02:03 PM
This
article claims that finding the area under a curve by dividing up the region into
rectangles is helpful. Maybe they could take some sort of... limiting process...GASARCH From Computational Complexity | July 7, 2011 at 04:28 PM
MATH ON TV
FUTURAMA mentions the Banach-Tarski Paradox!
In the June 23, 2011 episode Professor Farnsworth invents
a
Banach-Tarski-Dupla-Shrinker
which takeshere...GASARCH From Computational Complexity | June 28, 2011 at 02:30 PM
(A workshop on Coding, Complexity and Sparsity will be held at Ann Arbor,
August 1-4, 2011.
See this website.)
More thoughts on FCRC.
Russell Impagliazzo...GASARCH From Computational Complexity | June 27, 2011 at 05:10 PM
In 2002 I did a poll that appeared as SIGACT News Complexity Theory Column 36
on what people thought of P vs NP.
See here.
That article is now linked to on...GASARCH From Computational Complexity | June 20, 2011 at 04:56 PM
I do not log on at conferences so I came back to 400 emails.
Exactly 400- not sure how I managed that. TODAY I am posting about
a few things from FCRC, I may post...GASARCH From Computational Complexity | June 14, 2011 at 09:30 PM
I was at RatLoCC last week
which stands for Ramsey Theory in Logic, Combinatorics and Complexity.
The idea was to bring in researchers for all three areas (actually...GASARCH From Computational Complexity | May 31, 2011 at 06:42 PM
Cambridge Press (and others) offers PRINT-ON-DEMAND for some books.
This is a guest post by Lauren Cowles from Cambridge Books about this,
and then my commentsWhats...GASARCH From Computational Complexity | May 16, 2011 at 03:24 PM
Whose name (in firstname lastname form) appeared most often in the pages
of Newsweek in the 1970's? Is it---?
Richard Nixon
Gerald Ford
Jimmy Carter
Ken Regan...GASARCH From Computational Complexity | May 13, 2011 at 08:56 PM
Complexity theory has changed over the years.
How to really track these things?
One way is to look at the list of topics on the Call For papers for the
CCC conference...GASARCH From Computational Complexity | May 5, 2011 at 02:24 PM
(
Annoucements:
New York Theory day May 13 and
UMCP Theory Postdoc opening.
)
This is an anon guest blogger. Even we don't know who this is! He or she emailed...GASARCH From Computational Complexity | April 28, 2011 at 03:01 PM
I recently read and reviewed
The Pea and
The Sun by Leonard Wapner, which is about the Banach-Tarski Paradox.
Recall that the Banach-Tarski Paradox is actually...GASARCH From Computational Complexity | April 21, 2011 at 02:12 PM
Recently I went off topic in a class. I think it was okay but
I want YOUR thoughts.
On Monday I
defined
Primitive Recursive functions
showed them that addition...GASARCH From Computational Complexity | April 14, 2011 at 04:42 PM
The Center for intractability at Princeton is having a
Workshop on Approximation Algorithms.
Here
is the schedule of talks.
Vijay Vazirani, one of the organizers...GASARCH From Computational Complexity | April 13, 2011 at 02:12 PM
I have already blogged about (trying to) teach me
Nephew Jason math
here
and my Great Nephew Justin math
here.
Now its my Great Niece Jordan's turn.
I was at...GASARCH From Computational Complexity | April 7, 2011 at 02:47 PM
Today I read on
Lipton's Blog
that Phillipe Flajolet passed away (1948-2011).
Flajolet worked in Analytic Combinatorics.
His book with Sedgewick on the field
(see...GASARCH From Computational Complexity | March 29, 2011 at 04:28 PM
(I want to thank Bobby Kleinberg for bringing this to my attention.)
Consider the following voting scheme
Choose a random person A1.
A1 chooses a set at...GASARCH From Computational Complexity | March 28, 2011 at 06:10 PM
If you are a grad student and want to goto STOC 2011
there is travel support money that you can apply for.
See
here
for details.
We are particularly interested...GASARCH From Computational Complexity | March 18, 2011 at 05:14 PM