Communications of the ACM
Refine your search:
How the “Frontier” Became the Slogan of Uncontrolled AI
Artificial intelligence (AI) has been billed as the next frontier of humanity: the newly available expanse whose exploration …
From Computational Complexity
A natural function with very odd properties
Last time I posted some questions. Today I post the answer that I know. Is there a subset of [0,1] that is uncountable and has measure 0? YES- take theCantor...
From Computational Complexity
Six Questions about unnatrual and natural mathematical objects
Today (Monday) I pose some questions. In my next post (Tuesday) I will post the answersthat I know (some I do not). Some questions are a matter of opinionin terms...
From Computational Complexity
The Combinatorics of Batman
(I wrote this post about a year ago but waited until the new Batmanmovie came out to post it. I haven't seen the movie yet sothere may more possibilities to add...
From Computational Complexity
CCC12- post 4 of 4- Misc Info.
CCC 12 post 4 of 4. The business meeting and other observations. Programming committee info: There were 119 submissions of which 18 were junk (more on that...
From Computational Complexity
CCC 2012- Post 3 of probably 4
Post 3 of n on CCC 2012. I still don't know what n is. I summarize the third and fourth day of the conference. (The fourth day was only a half-day). Thursday June...
From Computational Complexity
CCC 2012: Post 2 of n
CC 2012. I still don't know what n is. I summarize the second day of the conference. Wednesday June 27 Morning Session: A Satisfiable Algorithm and Average Case...
From Computational Complexity
CCC12: Post 1 of n
(Post 1 of n on CCC 2012. I don't know how large n is yet.) I will discuss the papers in the order they were presented. June 26, 2012. Morning Amplifying Circuit...
From Computational Complexity
North Carolina tries to legislate science
(I will post on CCC 2012 next week. I am still recovering from Jet Lag and going through 472 emails that piled up on 2.5 weeks, of which 22 were relevent.) You...
From Computational Complexity
The Ketchup Problem
MIT scientists are working on a bottle of ketchup where you CAN get out every last drop. See here for details and some nice videos of the new bottle in action....
From Computational Complexity
Do 50-1 longshots in the Kentucky Derby ever come in?
(I delayed posting this until after The Belmont Stakes since I wanted to see if there would be a Triple Crown winner.Alas, I'll have another was scratched. From...
From Computational Complexity
A new bound on 3-hypergraph Ramsey Number! Why wasn't it discovered earlier?
When a new result is first discovered one question to ask is Why wasn't it discovered earlier? We look at a result in Ramsey Theory from 2010 and speculate asHypergraph...
From Computational Complexity
17x17: Paper that solved it available!/A contest inspired by it!/NPC result inspired by it!
Three new 17×17 items: The paper (and some sequels) that SOLVED the 17×17 problem and the 17×18 problem are now available here. (I can't seem to link to the page...
From Computational Complexity
STOC 2012- workshop and honored talks
I went to an enjoyed STOC this year. Today I talk about the workshops and the papers that either won awards or seem to be in the running. I may blog on other...
From Computational Complexity
Meetings/Conferences/Workshops/Seminars- whats in a name?
In June 11-14 will be a new workshop: Algorithmic Frontiers. How many venues do we have for meetings? What the call themselves: Meetings (e.g., MATHFEST), Conferences...
From Computational Complexity
So THATS why the 17x17 challenge was so hard. Or maybe not.
On November 30, 2009 I posted the famous 17x17 challenge: (Paraphrase) Find a 4-coloring of the 17x17 grid that has no monochromatic rectangles. For $289.00.here...
From Computational Complexity
Is it well known that we need to redefine well known?
A LONG time (so long ago I was a guest poster, not a co-blogger) I posted about how calling things that are on You-Tube rare is odd since ITS ON YOU-TUBE! ANYONE...
From Computational Complexity
Hanan Samt wins Kanellakis Prize!
( Symposium on Turing in Princeton in about a month UMCP is doing a job search for a lecturer New York Area Theory Day ) The Paris Kanellakis Theory and...
From Computational Complexity
I left Push Down Automata out of my class and learned some things!
This semester in the Ugrad Course titled Elementary Theory of Computation (Syllabus: Reg Languages, CFLs, Computability Theory, P and NP) I decided to NOT teach...
From Computational Complexity
How important is the PROOF of Cooks theorem for my ugrad class?
I am teaching Automata theory this semester. The topics are basically (1) Regular Languages, (2) Context Free Languages, (3) Decidable, undecidable, and c.e. sets...
From Computational Complexity