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
(In this age of lightenting fast communication I suspect
you all already know that Judea Pearl won the Turing Award.
Even so, it is worth posting about.)
Judea...GASARCH From Computational Complexity | March 16, 2012 at 12:58 PM
Euler was born April 15, 1707.
Hence by the Western Astrology that we all ignore he is an Aries.
However, I recently heard about another way (also worth ignoring)...GASARCH From Computational Complexity | March 14, 2012 at 04:59 AM
Is 1+4 a harder calculation than 4+1?
It may be if you are 2+3 years old.
I asked my 7-2 year old great niece Noelle the
following sequence of questions. I include...GASARCH From Computational Complexity | March 7, 2012 at 03:52 PM
The mathematician
Nicolaas Govert de Bruijn
passed away on Feb 17, 2012. The number of things named after him is quite large.
I will discuss the Erdos-de Bruijn...GASARCH From Computational Complexity | February 29, 2012 at 03:20 PM
(In honor of President's day which was two days ago.)
On Presidents Day last year I had my classes fill out a form saying who they thought
was the best, second...GASARCH From Computational Complexity | February 22, 2012 at 03:52 PM
Why do people or organizations offer Prize Money for mathematics?
Paul Erdos: He offered money to solve problems that
he found interesting. I assume he wanted...GASARCH From Computational Complexity | February 17, 2012 at 04:13 PM
STOC 2012 paper accepts are posted
here.
Travel support for grad students (which I am involved with) is posted
here.
On a quick glance:
I tried counting thehere...GASARCH From Computational Complexity | February 10, 2012 at 08:26 PM
THE 17x17 PROBLEM HAS BEEN SOLVED!!!!!
On Nov 30, 2009 I posted
here the following challenge:
If someone emails me a 4-coloring of 17x17 with
no monochromatic...GASARCH From Computational Complexity | February 8, 2012 at 01:14 PM
The following quote is from the back of a book that I dusted
off and took off of my shelf recently:
FORTRAN is one of the oldest high-level languages and remains...GASARCH From Computational Complexity | February 1, 2012 at 02:59 PM
Ernst Specker passed away in December.
He has 91. He was not the oldest living
mathematician. That title likely belongs to
Sergey Nikolsky.
A former student ofhere...GASARCH From Computational Complexity | January 30, 2012 at 01:23 PM
(Requested announcement: Calling all Women PhD Students (and a few undergrads)
We will be having our bi-annual Women in Theory (WIT) Workshop this year in
Princeton...GASARCH From Computational Complexity | January 27, 2012 at 03:20 PM
A few years ago I was assigned to teach the HONORS section of Discrete Math (a course for sophomores
who have had a year of programming and a year a calculus).
They...GASARCH From Computational Complexity | January 20, 2012 at 04:16 PM
The following quotes is from
In the book Algebra in Ancient and Modern Times by V.S. Varadarajan.
Fibonacci numbers thus grow very fast with N, indeed in geometric...GASARCH From Computational Complexity | January 17, 2012 at 03:00 PM
In Yesterday's post you were told about Susan:
Susan is 31 years old, single, outspoken and very
bright. She majored in philosophy. As a student she
was deeply...GASARCH From Computational Complexity | January 10, 2012 at 04:05 PM
Readers- I want you to answer this question and post your answers
as comments. I will tell you WHY I am asking tommorow.
Susan is 28 years old, single, outspoken...GASARCH From Computational Complexity | January 9, 2012 at 01:04 PM
(I have already posted this question on CS Theory Stack Exchange.)
If you know that 3-COL is NPC then you can prove that PLANAR 3-COL
is NPC by a NICE gadget...GASARCH From Computational Complexity | January 3, 2012 at 04:40 PM
How are Mitt Romney and Scott Aaronson similar? Different?
Similarities:
Both live in Massachusetts. Actually, Scott lives there but its not clear where Mitt...GASARCH From Computational Complexity | December 19, 2011 at 03:09 PM
In my last blog I asked you to look at this problem, try to solve it,
and tell me if you think it is too hard for a HS competition.
(I meant to post this on WED...GASARCH From Computational Complexity | December 14, 2011 at 05:13 AM
The Univ of MD HS Math Competition has two parts.
Part I is 25 multiple choice questions in 2 hours
(4 points for a correct answer, -2 for an incorrect answer)....GASARCH From Computational Complexity | December 12, 2011 at 02:13 PM
The recent discussion on Matrix Mult inspires the general
question of WHAT IS A BREAKTHROUGH?
Last year I tried to get an intelligent
discussion on this topic but...GASARCH From Computational Complexity | December 7, 2011 at 03:22 PM