tag:blogger.com,1999:blog-3722233Tue, 16 Jan 2018 19:11:19 +0000typecastfocs metacommentsComputational ComplexityComputational Complexity and other fun stuff in math and computer science from Lance Fortnow and Bill Gasarchhttp://blog.computationalcomplexity.org/noreply@blogger.com (Lance Fortnow)Blogger2548125tag:blogger.com,1999:blog-3722233.post-4918349967339814884Tue, 16 Jan 2018 16:41:00 +00002018-01-16T11:41:01.124-05:00Donald Knuth Turns 80 years and 6 daysCelebrating Donald Knuth's 80th birthday, or 80 years + 7 days birthday seems odd. Should we use powers of 2? Hmm- too few, just 32 and 64 really. And having a 32-year celebration for someone is unusual. How about numbers that end in 0 in base 8. 64 would be 100, 72 would 110, 80 would be 120 so AH- we would be celebrating! So lets Celebrate!<br />
<br />
LANCE: One of us should blog about Don Knuth turning 80.<br />
<br />
BILL: How about both of us, sep posts?<br />
<br />
Lance had his post <a href="http://blog.computationalcomplexity.org/2018/01/donald-knuth-turns-eighty.html">here</a>. Now its my turn.<br />
<br />
Donald Knuth was the first person (roughly- history is not as definite as mathematics) to use mathematics to analyse algorithms. This may seem like an obvious thing to do but that's easy to say in retrospect. And he never lost focus: He may have to use some hard math to analyze algorithms but his goal always was to analyze algorithms. He didn't get fascinated with some obscure aspect of math like, say, surreal numbers, and go write a book on it. Oh wait, he did (see <a href="http://www.math.harvard.edu/~knill/teaching/mathe320_2015_fall/blog15/surreal1.pdf">here</a>). But, for the most part everything he did was towards faster algorithm and faster typesetting.<br />
<i><br /></i>
In an early draft of a book review of <i>Companion \to the Papers of Donald Knuth </i>I wrote at the end of it<br />
<br />
<i> Donald Knuth has been called the father of Theoretical Computer Science and hence his thoughts are worth knowing</i><br />
<br />
I usually email my reviews to the author so they can make sure I didn't say anything stupid or in some very rare cases have a rebuttal. In Knuth's case I postal mailed it (ask your grandparents what that is) since he does not use email. He mailed back the hardcopy with some corrections in pencil. One of them was to cross out<br />
<br />
<i>father of theoretical computer science</i><br />
<i><br /></i>
and replace it with<br />
<br />
<i>father of algorithmic analysis.</i><br />
<i><br /></i>
I made the correction. That is how he views himself and it would be odd to argue the point.<br />
<br />
As a tribute to him I have gathered up all of the book reviews in my column of books by him (between 10 and 12 depending on how you count) and books clearly inspired by him (1 book- A=B) into one file which I point to <a href="https://www.cs.umd.edu/users/gasarch/BLOGPAPERS/knuth.pdf">here</a>. <br />
<br />
<br />
<br />
<br />http://blog.computationalcomplexity.org/2018/01/donald-knuth-turns-80-years-and-6-days.htmlnoreply@blogger.com (GASARCH)2tag:blogger.com,1999:blog-3722233.post-4889227120982533363Wed, 10 Jan 2018 13:26:00 +00002018-01-10T08:26:02.861-05:00Donald Knuth Turns EightyWe've kept this blog going long enough that we start repeating our celebrations. Ten years ago Bill <a href="http://blog.computationalcomplexity.org/2008/01/today-is-knuths-70th-birthday.html">celebrated Don Knuth's 70th Birthday</a> and today Donald Knuth turns 80. While he <a href="http://knuth80.elfbrink.se/">celebrates in Piteå, Sweden</a> with its less than 4.5 hours of daylight, we wish him a happy birthday from stateside.<br />
<div>
<br /></div>
<div>
Looking back in this blog, in 2015 I wrote about the <a href="http://blog.computationalcomplexity.org/2015/01/the-history-of-history-of-history-of.html">history of the history of computing</a> including this wonderful talk by Knuth, <a href="https://youtu.be/gAXdDEQveKw">Let's Not Dumb Down the History of Computer Science</a>.<br />
<br /></div>
<iframe allow="encrypted-media" allowfullscreen="" frameborder="0" gesture="media" height="315" src="https://www.youtube.com/embed/gAXdDEQveKw" width="560"></iframe>
<br />
<div>
<br />
Donald Knuth is known for many things, important algorithms, the brilliant book series The Art of Computer Programming, TeX, the many awards he's won and the <a href="https://www.sigact.org/Prizes/Knuth/">award named after him</a>. In my favorite story, back in the 70's when Knuth started working on Volume 4 (still in progress), he wanted a good name for those hard problems that Cook and Karp found. His candidates "Herculean", "Formidable" and "Arduous" didn't get much traction so he <a href="http://blog.computationalcomplexity.org/2010/11/by-any-other-name-would-be-just-as-hard.html">ran a contest</a> which had some interesting suggestions before reluctantly going with the name "NP-complete" that came out of a group from MIT.<br />
<br />
In his <a href="https://doi.org/10.1145/1811129.1811130">SIGACT News article</a> that described the contest, Donald Knuth was so sure that these hard problems would remain hard, he puts everything on the line, offering anyone who could prove P = NP a live turkey. May Don Knuth and his turkey continue to celebrate many more birthdays.</div>
http://blog.computationalcomplexity.org/2018/01/donald-knuth-turns-eighty.htmlnoreply@blogger.com (Lance Fortnow)5tag:blogger.com,1999:blog-3722233.post-5465544257965312428Mon, 08 Jan 2018 02:21:00 +00002018-01-07T22:20:19.733-05:00A new largest prime found!A new largest KNOWN prime has been discovered and its 23 million digits long.<br />
<br />
Nate Silver's website had an article about it (written by Oliver Roeder) <a href="https://fivethirtyeight.com/features/we-have-a-new-prime-number-and-its-23-million-digits-long/">here</a><br />
<br />
An article about why people do this is <a href="http://primes.utm.edu/notes/faq/why.html">here</a><br />
<br />
Lance posted about finding large primes in 2006 <a href="http://blog.computationalcomplexity.org/2006/01/search-without-end.html">here</a><br />
<br />
I'll just make some random comments<br />
<br />
1) The prime is 2<sup>77,232,917</sup>-1<br />
<br />
2) The prime is not much bigger than the previous champion.<br />
<br />
3) More generally, the graph (in Oliver Roeder's article) shows from 1600 to about 1951there was slow progress but since then there has been LOTS of progress. See the table in <a href="https://en.wikipedia.org/wiki/Largest_known_prime_number">this</a> article. I had wanted to say <i>every year a new prime was found</i> but, alas, not that simple a pattern. Even so, lots of new records.<br />
<br />
4) I"ll list the reasons given for why people do this and my comments on them.<br />
<br />
a) Tradition! (Note to self- write a novelty song to the tune of Fiddler-on-the-roof's Tradition about why people work on various mathematical things)<br />
<br />
b) For the by-product of the quest. This one does make sense and I am sure has driven and helped test out some research. Reminds me of the spinoffs from going to the moon (see <a href="https://en.wikipedia.org/wiki/NASA_spinoff_technologies">here</a>). Contrary to what I heard as a kid, the orange-powder-drink Tang was not a spinoff. But there were many others. Of course- would these spinoffs have happened anyway? Hard to know.<br />
<br />
c) People collect rare and Beautiful items. I don't really see this one. Finding a large prime doesn't make its yours, it belongs to the ages! And I don't think people get their names on the prime either. The only prime that has someone's name on it is the famous <a href="https://en.wikipedia.org/wiki/57_(number)">Grothendieck prime</a> which is 57. Oh well. There are sets of primes with peoples names on them: <a href="https://en.wikipedia.org/wiki/Mersenne_prime">Mersenne primes</a>, <a href="https://en.wikipedia.org/wiki/Gaussian_integer#Gaussian_primes">Gaussian primes</a> (which are subsets of Gaussian integers so maybe shouldn't count), <a href="https://en.wikipedia.org/wiki/Eisenstein_prime">Eisenstein primes</a>, and<br />
<a href="https://en.wikipedia.org/wiki/Sophie_Germain_prime">Sophie Germain primes</a>. If you know of any other primes or set of primes named after someone, leave a comment please.<br />
<br />
d) For the glory! Maybe, but given how briefly people hold the record, fame is fleeting.<br />
<br />
e) To test the hardware. This one I didn't know! I'll quote the article as to why primes are good for this<br />
<blockquote class="tr_bq">
Why are prime programs used this way? They are intensely CPU and bus bound. They are relatively short, give an easily checked answer (when run on a known prime they should output true after their billions of calculations). They can easily be run in the background while other "more important" tasks run, and they are usually easy to stop and restart.</blockquote>
f) To learn more about their distribution. The prime number theorem was conjectured from data. We have so many primes now that I wonder if a few more really help formulate conjectures<br />
<br />
g) For the money. The first person to get a ten-million digit prime gets $100,000. The first person to get a one billion digit prime gets $250,000. Wow! Except that the article must be a bit old since the $100,000 prize was claimed in 2009 (see <a href="https://www.eff.org/press/archives/2009/10/14-0">here</a>). Still, theres that one billion digit prize out there!<br />
<br />
5) Mersenne primes are of the form 2^n-1. It is known that n must be prime for 2^n-1 to be prime (this is not hard). There are much faster primality testing algorithms for Mersenne primes than arb primes. But see next item.<br />
<br />
6) While writing this blog post I looked up non-mersenne primes. It seems like the largest one is<br />
<br />
10223*2^31172165 + 1 and was discovered in 2016.<br />
<br />
But of more interest- there is no Wikipedia page on non-Mersenne primes, there are some outdated pages that don't have the most recent information. As the kids say, its not a thing.<br />
<br />
8) I'll add one more reason why people work on this, but its more of a tautology: People work on finding large primes because they can!. By contrast, finding VDW numbers is hard and likely to not make much progress.<br />
<br />
9) I think that the most reason advances have come from computing power and not number theory. (if this is incorrect let me know with a polite comment)<br />
<br />
10) Have their been spinoffs in either number theory OR computing power lately?<br />
<br />
11) I wonder if there will come a point where progress gets hard again and the graph of largest known primes flattens out. I tend to think yes, but hard to say when.http://blog.computationalcomplexity.org/2018/01/a-new-largest-prime-found.htmlnoreply@blogger.com (GASARCH)4tag:blogger.com,1999:blog-3722233.post-2653680872648610604Fri, 05 Jan 2018 16:20:00 +00002018-01-05T11:20:37.476-05:00Which of these Math acronyms are well known? The last time I taught Grad Ramsey Theory there were very good math grads and ugrads in it. They used some acronyms - some I knew, some I didn't know (but know now). I am sure some are well known and some are now. I don't know which is which. Here is the list and comments<br />
<div>
<br /></div>
<div>
WLOG- Without Loss of Generality. This one I know and it seems well know-- When Googled the first page is all this definition. (Maybe I shouldn't use the term ``Googled''- I've heard that brand names don't like it when they become generic terms like `Googled'. Kleenex, Photoshop, Xerox had this fate. Their is a word for it- genericide)</div>
<div>
<br /></div>
<div>
ITOT- It turns out that. An Applied Math Prof used this in a course I had in 1977. I have not seen it used since then. I don't even use it. </div>
<div>
<br /></div>
<div>
BWOC- By Way of Contradiction. I thought this was better known. When I google it I got to <a href="https://acronyms.thefreedictionary.com/BWOC">this</a> page which tells me it stands for:</div>
<div>
<br /></div>
<div>
Big Wolf on Campus (TV Show)</div>
<div>
<br /></div>
<div>
By Weight of Cement (Oil and Gas industry)</div>
<div>
<br /></div>
<div>
Big Women on Campus (GOOD- the counterpart to BMOC)</div>
<div>
<br /></div>
<div>
By Way of Contradiction (Given the other items on the list I'm surprised it made the cut)</div>
<div>
<br /></div>
<div>
Bob Wayne's Oil company</div>
<div>
<br /></div>
<div>
FTSOC- For the Sake of Contradiction. NOT, as Google told me, Fuck this Shit O'Clock (reminds me of when I use FML for Formula and the class tells me its means Fuck My Life)</div>
<div>
<br /></div>
<div>
WTS- This was a new one for me. It took a while to get it from context but it was Want to Show. Google gives Women in Transportation. </div>
<div>
<br /></div>
<div>
NTS- Need to show. Also a radio station and the National Traffic System.</div>
<div>
<br /></div>
<div>
I think the only one of these that is standard is WLOG. The rest I think could be useful. But I ask you- are any of these standard? Are there ones that are standard that I missed? Of course, the great thing about standards is that there are so many of them.</div>
<div>
<br /></div>
<div>
<br /></div>
<div>
<br /></div>
<div>
<br /></div>
http://blog.computationalcomplexity.org/2018/01/which-of-these-math-acronyms-are-well.htmlnoreply@blogger.com (GASARCH)12tag:blogger.com,1999:blog-3722233.post-1397406569442302463Wed, 27 Dec 2017 18:40:00 +00002017-12-29T12:12:49.643-05:00Complexity Year in Review 2017Theorem of the year goes to the resolution of the dichotomy conjecture. I wrote <a href="http://blog.computationalcomplexity.org/2017/02/the-dichotomy-conjecture.html">about the conjecture</a> in February and while the Feder et. al paper didn't hold up, two later papers seem to resolve the conjecture.<br />
<br />
<div style="text-align: center;">
<a href="https://doi.org/10.1109/FOCS.2017.37">A dichotomy theorem for nonuniform CSPs</a> by Andrei Bulatov</div>
<div style="text-align: center;">
<a href="https://doi.org/10.1109/FOCS.2017.38">A Proof of CSP Dichotomy Conjecture</a> by Dmitriy Zhuk<br />
<br />
<div style="text-align: left;">
I checked with experts in the field and at least one of these papers and more likely both ought to be correct.</div>
<div style="text-align: left;">
<br /></div>
<div style="text-align: left;">
Runners up include two matching papers I <a href="http://blog.computationalcomplexity.org/2017/11/matching-and-complexity.html">posted about last month</a>, Svensson and Tarnawski who give a <a href="https://doi.org/10.1109/FOCS.2017.70">quasi-NC algorithm for general graph matching</a> and Anari and Vazirani who give a<a href="https://arxiv.org/abs/1709.07822"> NC algorithm for matching on planar graphs</a>. We also had the nice <a href="https://doi.org/10.1145/3055399.3055409">quasi-polynomial time algorithm for parity games</a> by Calude, Jain, Khoussainov, Li and Stephan that I <a href="http://blog.computationalcomplexity.org/2017/03/parity-games-in-quasipolynomial-time.html">posted on last March</a>.</div>
<div style="text-align: left;">
<br /></div>
<div style="text-align: left;">
In <a href="http://blog.computationalcomplexity.org/2016/12/complexity-year-in-review-2016.html">last year's review</a> we said "2016 will go down as a watershed year for machine learning" yet somehow it paled against 2017 with breakthroughs in <a href="http://blog.computationalcomplexity.org/2017/12/our-ai-future-good-and-ugly.html">chess</a>, <a href="http://blog.computationalcomplexity.org/2017/02/liberatus-wins-at-poker.html">poker</a>, <a href="https://www.nasa.gov/press-release/artificial-intelligence-nasa-data-used-to-discover-eighth-planet-circling-distant-star">astronomy</a> not to mention continuous advances in machine translation, autonomous vehicles and everything else. Maybe next year ML can write the 2018 year in review.<br />
<br />
We had an awesome eclipse to remind us of the wonders of the world and almost made me forget about US politics. Computing keeps growing and how do we find the resources to train people from pre-school through college and throughout their lives? How much should we worry about the dominance of a handful of computing companies? </div>
<div style="text-align: left;">
<br /></div>
<div style="text-align: left;">
Thanks to our guest posters <a href="http://blog.computationalcomplexity.org/2017/01/guest-post-about-first-women-in.html">Erin Chambers, Brittany Terese Fasy, Lori Ziegelmeier</a>, <a href="http://blog.computationalcomplexity.org/2017/08/i-wanted-to-address-diversity-after.html">Molly Fortnow</a> and <a href="http://blog.computationalcomplexity.org/2017/05/how-to-solve-it.html">Periklis Papakonstantinou</a>. </div>
<div style="text-align: left;">
<br /></div>
<div style="text-align: left;">
<span style="font-family: inherit;">We remember <a href="http://blog.computationalcomplexity.org/2017/02/ken-arrow-and-oscars-voting.html">Ken Arrow</a>, <a href="https://lucatrevisan.wordpress.com/2017/10/23/corrado-bohm/">Corrado Bohm</a>, <a href="https://lucatrevisan.wordpress.com/2017/09/26/3915/">Michael Cohen</a>, <a href="http://www.ustavinformatiky.cz/petrhajek/">Petr Hájek</a>, <a href="http://blog.computationalcomplexity.org/2017/10/monty-hall-1921-2017-and-his-problem.html">Monty Hall</a>, <a href="http://binaire.blog.lemonde.fr/2017/09/22/ciao-maurice/">Maurice Nivat</a>, <span style="font-size: 11pt; text-align: center; white-space: pre-wrap;"><a href="http://blog.computationalcomplexity.org/2017/02/raymond-smullyan-was-born-on-may-25.html">Raymond Smullyan</a>, <a href="http://blog.computationalcomplexity.org/2017/07/peter-wegner-1932-2017.html">Peter Wegner</a> and <a href="https://www.nytimes.com/2017/09/11/science/lotfi-zadeh-father-of-mathematical-fuzzy-logic-dies-at-96.html">Lotfi Zadeh</a>. </span></span></div>
<div style="text-align: left;">
<br /></div>
<div style="text-align: left;">
2018 is just full of questions: What will the Internet look like post-net neutrality? How will the new tax code play out? Where will Amazon put HQ2? What will machine learning do next? What can quantum computers with 50 qbits accomplish? Will bitcoin move to $300K or 30 cents? And what great advances in complexity await us?</div>
</div>
http://blog.computationalcomplexity.org/2017/12/complexity-year-in-review-2017.htmlnoreply@blogger.com (Lance Fortnow)0tag:blogger.com,1999:blog-3722233.post-7435476721848448894Thu, 21 Dec 2017 15:14:00 +00002017-12-21T10:14:33.218-05:00Having Faith in ComplexityI believe P ≠ NP as much as anyone else. Nevertheless should we worry about trust we put in complexity?<br />
<br />
You don't need the full power of P = NP to break cryptography. I don't worry about quantum computers breaking RSA and related protocols. It won't sneak up on us--when (or if) quantum computing gets anywhere close to factoring large numbers, we'll figure out a strategy to change our protocols and to protect the information we already have. However if someone comes up with an algorithm tomorrow that cracks AES, we'll have a crisis on our hands as AES is so well used the algorithm is embedded into computer chips. Perhaps we can mitigate the damage before the algorithm spreads or at take our information off-line until we develop new solutions.<br />
<br />
But what about blockchains, the technology that underlies cryptocurrencies such as Bitcoin. A blockchain consists of a series of transactions collected into sequence of blocks, where each block consists of a hash of the previous block with transactions themselves hashed and often encrypted with public-key cryptography. One would hope that breaking the cryptography would be caught quickly and we'd still have a legit record of transactions saved somewhere. The transactions themselves might be compromised especially if anonymity was built into the system.<br />
<br />
Bitcoin itself, as I write this, has a total market cap of over $250 billion based fully on cryptography. The cryptography will probably hold up, Bitcoin investors have more to worry from bad implementations or the pop of a bubble of unrealistic expectations. But as we watch so many exciting advances in computing tackling challenges that we would never have expected to get solved, should we continue to build our economy on the hope that other advances won't happen?http://blog.computationalcomplexity.org/2017/12/having-faith-in-complexity.htmlnoreply@blogger.com (Lance Fortnow)2tag:blogger.com,1999:blog-3722233.post-3402935024911175741Mon, 18 Dec 2017 03:18:00 +00002017-12-17T22:18:15.766-05:00Monkey First!The following story is not true nor has anyone claimed its true, but it has a point:<br />
<br />
<i>A company gets a contract to do the following: train a monkey to sit on a 10-foot pedestal and recite some passages of Shakespeare. After a week they announce they have made progress! They invite their investors to see what progress they have made! They unveil a curtain and there is... a 10-foot pedestal.</i><br />
<i><br /></i>
This story was in an article about how Google does moonshots-- that is, high-risk, high-reward, innovative work. The article is <a href="https://www.theatlantic.com/magazine/archive/2017/11/x-google-moonshot-factory/540648/">here</a>. (How the Atlantic makes money when they have stuff online is a mystery to me. Perhaps they do in a very innovative way.) The point is that its BAD to have tangible results (like the pedestal) that are not getting at the heart of the problem. So Google has various incentives to do the important stuff. Their slogan is MONKEY FIRST.<br />
<br />
This also applies to our research. The following sequence of events is common:<br />
<br />
1) Prove some scattered results.<br />
<br />
2) Pedastal or Monkey? You could write up what you have, polish it, write up some nice LaTeX macros to make the writing of the paper easier OR you could try to find the unifying principle that would be hard, and might not work, but if it works that would be, as the kids say, Jawesome (Jaw-dropping awesome). The sad answer is that which you do might depend on when the next conference deadline is.<br />
<br />
More generally there is a tension between safe do-able research(Pedestal) and high-risk, high-reweard research (Monkey). Is our incentive structure set up to encourage high-risk high-reward? The Tenure system is supposed to do it and it DOES in some cases, but not as much as it could since there are other factors (salary, promotion to full prof, grants).<br />
<br />
Does the system encourage high-risk high-reward? Should it? Could we do better? What are your experiences? I have no answers (especially to the question of what are your experiences) so I welcome your comments.http://blog.computationalcomplexity.org/2017/12/monkey-first.htmlnoreply@blogger.com (GASARCH)3tag:blogger.com,1999:blog-3722233.post-3946711197336225173Wed, 13 Dec 2017 18:46:00 +00002017-12-14T10:43:37.871-05:00Our AI future: The Good and the UglyI don’t directly work in machine learning but one cannot deny the progress it has made and the effect it has on society. Who would have thought even a few years ago that ML would have basically solved face and voice recognition and translate nearly as well as humans.<br />
<br />
The <a href="https://nips.cc/">Neural Information Process Systems conference</a> held last week in Long Beach, California, sold out its 7500 registration slots in 12 days. NIPS, not long ago just another academic conference, has become a major machine learning job market <a href="https://www.bloomberg.com/news/articles/2017-12-06/demand-for-ai-talent-turns-once-staid-conference-into-draft-day">where newly minted Ph.D.s earn north of $300,000 and top-ranked senior academics command multimillion-dollar, multiyear contracts</a>."<br />
<br />
AlphaZero, an offshoot of Google’s Go programs, <a href="https://arxiv.org/abs/1712.01815">learned chess given only the rules</a> in just four hours (on 5000 tensor processing units) and easily beats the best human-designed chess programs. <a href="https://youtu.be/UcAfg9v_dDM">Check out</a> this match against Stockfish.<br />
<br />
<iframe allow="encrypted-media" allowfullscreen="" frameborder="0" gesture="media" height="315" src="https://www.youtube.com/embed/UcAfg9v_dDM" width="560"></iframe>
<br />
<br />
Just a trend that machine learning often works better when humans just get out of the way.<br />
<br />
The advances in machine learning and automation have a dark side. Earlier this week I attended the <a href="https://cra.org/events/summit-technology-jobs/">CRA Summit on Technology and Jobs</a>, one of a series of meetings organized by Moshe Vardi on how AI and other computing technology will affect the future job market. When we talk about ethics in computer science we usually talk about freedom of information, privacy and fairness but this may be the biggest challenge of them all.<br />
<br />
The most stark statistic: Contrary to what certain politicians may tell you, manufacturing output in the United States has never been higher, but <a href="http://www.acting-man.com/?p=46399">manufacturing jobs have declined dramatically</a> due to automation.<br />
<br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://2.bp.blogspot.com/-LW_N4orfguc/WjF1T6qF2HI/AAAAAAABelU/AW3_WpuIESQ-iQRX-BZzxqLoRCL0Fl7aACLcBGAs/s1600/1-Manufacturing-output-vs.-employment.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" data-original-height="786" data-original-width="1600" height="196" src="https://2.bp.blogspot.com/-LW_N4orfguc/WjF1T6qF2HI/AAAAAAABelU/AW3_WpuIESQ-iQRX-BZzxqLoRCL0Fl7aACLcBGAs/s400/1-Manufacturing-output-vs.-employment.png" width="400" /></a></div>
<br />
The changes have hit hardest for white middle-class less educated males. While this group usually doesn’t get much attention from academics, they have been hit hard, often taking less rewarding jobs or dropping out of the job market entirely. We're seeing many young people living with their parents spending their days playing video games and see a spike in suicides and drug use. Drug overdose is the now the leading cause of death of men under 50.<br />
<br />
There are no easy solutions. Universal basic income won’t solve the psychological need a job plays in being a part of something bigger than oneself. In the end we'll need to rethink the educate-work-retire cycle towards more life-long learning and find rewarding jobs that go around automation. This all starts by having a government that recognizes these real challenges.http://blog.computationalcomplexity.org/2017/12/our-ai-future-good-and-ugly.htmlnoreply@blogger.com (Lance Fortnow)17tag:blogger.com,1999:blog-3722233.post-5651408255944287759Tue, 12 Dec 2017 14:33:00 +00002017-12-13T07:26:24.321-05:00Interesting Probability on a VERY OLD TV showI have posted about things I see in TV or Movies that are math or CS related:<br />
<br />
Do TV shows overestimate how much a genius can help solve crimes or make really good crystal meth which seems to be blue. YES, see <a href="http://blog.computationalcomplexity.org/2013/09/crystal-math-what-numb3rs-and-breaking.html">here</a><br />
<br />
Do TV shows get math wrong. YES, see <a href="http://blog.computationalcomplexity.org/2007/09/math-on-tv.html">here</a> and about 90% of the episodes of Numb3rs<br />
<br />
Closer to home- do TV shows say stupid things about P vs NP. Elementary (one of the two Modern Day Sherlock Holmes shows did) does see <a href="http://blog.computationalcomplexity.org/2013/10/p-vs-np-is-elementary-no-p-vs-np-is-on.html">here</a><br />
<br />
Did Kirk and Spock really defeat a computer by a trick that wouldn't work now. Yes, see Lance's post on this <a href="http://blog.computationalcomplexity.org/2015/11/star-trek-computing.html">here</a><br />
<br />
Do TV shows use the word Quantum incorrectly? They do but they are not alone as such, see <a href="http://blog.computationalcomplexity.org/2015/11/is-word-quantum-being-used-properly-by.html">here</a><br />
<br />
Do people writing Futrama get their math right! Yes- see <a href="http://blog.computationalcomplexity.org/2010/08/new-math-on-futurama_24.html">here</a><br />
<br />
Do people writing 24 get their math wrong! Yes- see <a href="http://blog.computationalcomplexity.org/2010/05/24-really-bad-game-theory-technology.html">here</a><br />
<br />
Does the Big Bang Theory mostly get things right? Yes! - see <a href="http://blog.computationalcomplexity.org/2014/04/the-big-bang-theory-hits-close-to-home.html">here</a><br />
<br />
There are more (Seinfeld things comedians should learn proofs! Really- see <a href="http://blog.computationalcomplexity.org/search?q=Seinfeld">here</a>) but I can make my point just with the ones above.<br />
<br />
ALL of the TV shows except Star Trek were from after 2000 (or so). So, with the exception of Science Fiction, math-refs and sci-refs in TV shows are relatively recent- I had thought.<br />
<br />
Which is why I was surprised and delighted to see, an episode of the old western (anti-western? satire of a western?) Maverick, from 1958 (before I was born!), called Rope of Cards a CORRECT and INTERESTING math reference.Maverick bets that a random 25 cards from a deck of cards can be arranged into five 5-card pat hands (I had to look that up-- hands where you don't want to discard any cards, so flush, a straight, a full house would qualify. 4 of a kind would be pat if there were no wild cards). The sucker takes the bet and loses. Maverick later says the odds are high and called the game Maverick Solitaire.<i>And that is now the name of the puzzle</i>- see <a href="http://www.solitairelaboratory.com/maverick.html">here</a>. The prob is around 0.98.<br />
<br />
I call this a mention of math since it has to do with probability- which may be a stretch. And I doubt the scene would encourage people to go into math. But it might encourage one to learn probability either to sucker others or to not be suckered.<br />
<br />
So the question now is- are there other non-science-fiction, refs to math in older TV shows?<br />
I suspect yes - similar to the one above which is gambling and probability. What is the earliest mention of math on a TV show? The oldest that did not involve science fiction or gambling?<br />
<br />
<br />http://blog.computationalcomplexity.org/2017/12/interesting-probability-on-very-old-tv.htmlnoreply@blogger.com (GASARCH)3tag:blogger.com,1999:blog-3722233.post-6808675670243082862Thu, 07 Dec 2017 15:21:00 +00002017-12-07T20:14:26.103-05:00Razor's EdgeInformally the sensitivity conjecture asks whether every hard Boolean function has a razor's edge input, where flipping a random bit has a reasonable chance of flipping the output.<br />
<div>
<br /></div>
<div>
Let's be more precise. We consider functions f mapping {0,1}<sup>n</sup> to {0,1}. For every input x, the decision tree complexity at x is the least number of bits of x you would need to query to decide whether the function outputs 0 or 1. The decision tree complexity of a function is the maximum decision tree complexity over all possible x. Most interesting functions have high decision tree complexity, even the lowly OR function requires querying every bit on the input of all zeroes. The decision tree complexity is polynomially-equivalent to randomized-complexity, quantum complexity, certificate complexity, and the degree of a polynomial that computes the function exactly or approximately. The <a href="https://doi.org/10.1145/2897518.2897644">recent</a> <a href="https://eccc.weizmann.ac.il/report/2015/175/">paper</a> by Aaronson, Ben-David and Kothari gives a nice chart showing the relationship between these measures and references to the various papers giving the bounds.<br />
<br /></div>
<div>
The sensitivity of f on an input x is the number of bit locations i such that f(x)≠f(x⊕i) where x⊕i is x with the ith bit flipped. The sensitivity of f is the maximum sensitivity over all inputs. The sensitivity conjecture states that there is some ε>0 such that the sensitivity of f is at least m<sup>ε</sup> if the decision tree complexity is at least m. If the conjecture were true then for any function with maximal decision tree complexity n (querying every input bit) there must be some razor's edge input x such that flipping a random bit of x has probability at least n<sup>-ε</sup> of flipping the output.<br />
<br />
I find it surprising that we have no proof or counterexample to this purely combinatorial question. There is a generalization of sensitivity known as block sensitivity which is the largest set of disjoint blocks where flipping the bits in any block flips the output bit. Block sensitivity is known to be polynomially related to decision tree complexity.<br />
<br />
In a future post I'll talk about some approaches towards resolving this conjecture.</div>
http://blog.computationalcomplexity.org/2017/12/razors-edge.htmlnoreply@blogger.com (Lance Fortnow)4tag:blogger.com,1999:blog-3722233.post-4891289667015158297Tue, 05 Dec 2017 04:00:00 +00002017-12-04T23:00:20.553-05:00Fireside chat with Simons Inst Director Dick Karp<div>
<a href="https://simons.berkeley.edu/events/fireside-chat-simons-institute-director-dick-karp">Fireside chat with Dick Karp</a></div>
<div>
<br /></div>
<div>
<br /></div>
<div>
Above link is Samir Khuller interviewing Dick Karp, though its labelled as a fireside chat with Dick Karp.</div>
<div>
<br /></div>
<div>
Very interesting to hear how TCS has evolved. More generally its good to know where you've come from to have a better idea of where you're going.</div>
<div>
<br /></div>
<div>
bill g.</div>
http://blog.computationalcomplexity.org/2017/12/fireside-chat-with-simons-inst-director.htmlnoreply@blogger.com (GASARCH)0tag:blogger.com,1999:blog-3722233.post-857373476905734669Thu, 30 Nov 2017 12:35:00 +00002017-11-30T07:35:36.711-05:00Kolmogorov Complexity and the PrimesBill's <a href="http://blog.computationalcomplexity.org/2017/11/van-der-waerdens-theorem-implies.html">post</a> on how to derive the non-finiteness of the primes from Van der Waerden's theorem reminds me of a nice proof using Kolmogorov complexity.<br />
<br />
A quick primer: Fixed some universal programming language. Let C(x), the Kolmogorov complexity of x, be the length of the smallest program that outputs x. One can show by a simple counting argument for every n there is an x such that C(x) ≥ n. We call such x "random".<br />
<br />
Suppose we had a finite list of primes p<sub>1</sub>…p<sub>k</sub>. Then any number m can be expressed as p<sub>1</sub><sup>e<sub>1</sub></sup>···p<sub>k</sub><sup>e<sub>k</sub></sup>. Pick n large, a random x of length n and let m be the number x expresses in binary. We can compute m from e<sub>1</sub>,…,e<sub>k</sub> and a constant amount of other information, remembering that k is a constant. Each e<sub>i</sub> is at most log m and so we can describe all of them in O(log log m) bits and thus C(m) = O(log log m). But roughly C(m) = C(x) ≥ n = log m, a contradiction.<br />
<br />
But we can do better. Again pick n large, a random x of length n and let m be the number x expresses in binary. Let p<sub>i</sub> be the largest prime that divides m where p<sub>i</sub> is the ith prime. We can describe m by p<sub>i</sub> and m/p<sub>i</sub>, or by i and m/p<sub>i</sub>. So we have C(m) ≤ C(i,m/p<sub>i</sub>) ≤ C(i) + C(m/p<sub>i</sub>) + 2 log C(p<sub>i</sub>) ≤ log i + log m/p<sub>i</sub> + 2 log log i + c. The 2 log C(p<sub>i</sub>) term is needed to specify the separation between the program for i and the program for m/p<sub>i</sub>.<br />
<br />
Since C(m) ≥ log m, we have<br />
log m ≤ log i + log (m/p<sub>i</sub>)+ 2 log log i + c<br />
log m ≤ log i + log m - log p<sub>i</sub> + 2 log log i + c<br />
log p<sub>i</sub> ≤ log i + 2 log log i + c<br />
p<sub>i</sub> ≤ O(i (log i)<sup>2</sup>)<br />
<br />
The prime number theorem has p<sub>i</sub> approximately i log i, so we get just a log factor off from optimal with simple Kolmogorov complexity.<br />
<br />
I wrote a <a href="http://bibbase.org/network/publication/fortnow-kolmogorovcomplexity-2001">short introduction</a> to Kolmogorov complexity with this proof. I originally got the proof from the <a href="http://amzn.to/2jxLOhx">great text</a> on Kolmogorov complexity from Li and Vitányi and they give credit to Piotr Berman and John Tromp.http://blog.computationalcomplexity.org/2017/11/kolmogorov-complexity-and-primes.htmlnoreply@blogger.com (Lance Fortnow)3tag:blogger.com,1999:blog-3722233.post-4511892902627593093Mon, 27 Nov 2017 18:18:00 +00002017-11-28T15:08:38.059-05:00Van der Waerden's theorem implies the infinitude of the primes<br />
(Sam Buss and Denis Hirschfeld helped me on this post.)<br />
<br />
I was reading the table of contents of the American Math Monthly and saw an article by Levent Alpoge entitled<br />
<br />
Van der Waerden and the primes<br />
<br />
in which he showed from VDW's theorem that the set of primes is infinite. The article is <a href="http://www.cs.umd.edu/~gasarch/BLOGPAPERS/primesinfvdwamm.pdf">here</a> and <a href="http://www.jstore.org/stable/10.4169/amer.math.monthly.122.8.784">here</a><a href="http://www.cs.umd.edu/~gasarch/BLOGPAPERS/primesinfvdw.pdf">.</a> My writeup of it <a href="http://www.cs.umd.edu/~gasarch/BLOGPAPERS/primesinfvdw.pdf">is here</a>. Prof K saw me reading the paper.<br />
<br />
K: I see you are interested in proving the set of primes is infinite from VDW's theorem.<br />
<br />
BILL: Yes, who wouldn't be!!!!<br />
<br />
K: Well, lots of people. Including me. Can't you just state VDW's theorem and then give the normal proof? Would that count? Besides, we already have an easy proof that the set of primes is infinite without using VDW's theorem.<br />
<br />
I turn K's comments into a valid question: What does it mean to <i>prove A from B </i>if A is already known?<br />
<br />
There are two issues here, informal and formal.<br />
<br />
Informally: If you look at the proof of <i>VDW-->primes infinite</i> the steps in that proof look easier than than the usual proof that the set of primes is infinite. And the proof is certainly different. If you read the paper you will see that I am certainly not smuggling in the usual proof. Also, the proof truly does use VDW's theorem.<br />
<br />
Formally one could (and people working in Reverse Mathematics do similar things- see the books <a href="http://www.personal.psu.edu/t20/sosoa/chapter1.pdf">Subsystems of Second order Arithmetic by Simpson,</a>, and <a href="http://www.amazon.com/Slicing-Truth-Mathematics-Combinatorial-Mathematical-ebook/dp/B00Q5Y3YW6/ref=sr_1_2?ie=UTF8&qid=1445694504&sr=8-2&keywords=Slicing+the+truth">Slicing the Truth,</a> reviewed <a href="http://www.cs.umd.edu/~gasarch/BLOGPAPERS/slice.pdf">here</a>) devise a weak axiom system that itself cannot prove <i>the set of Primes is Infinite</i>, but can prove the implication <i>VDW-->Primes infinite</i>. Note that Reverse Mathematics does this sort of thing, but for proofs involving infinite objects, nothing like what I am proposing here.<br />
<br />
Open Problem 1: Find a proof system where the implication VDW-->Primes infinte can be proven, but primes infinite cannot. Sam Buss pointed out to me that for the weak system IΔ<sub>0</sub> it is not known if it can prove the primes are infinite.<br />
<br />
Open Problem 2: Find a proof system where you can do both proofs, but the prove of the implication is much shorter. Perhaps look at (VDW--> there are at least n primes) and (there are at least n primes)<br />
and look at the length of proof as a function of n.<br />
<br />
Open Problem 3: The statement <i>there are no primes with n bits, the with leading bit 1 </i>can be expressed as a propositional statement. Get lower bounds on its refuation in (say) resolution. (A commenter pointed out an error in a prior version of this one so be wary- there may be an error here as well.)<br />
<br />
I am suggesting work on the reverse mathematics of systems much weaker than RCA<sub>0</sub>. I do not know if this is a paper, a PhD thesis, a career, a dead end, or already pretty much done but I am not aware of it.<br />
<br />
<br />http://blog.computationalcomplexity.org/2017/11/van-der-waerdens-theorem-implies.htmlnoreply@blogger.com (GASARCH)6tag:blogger.com,1999:blog-3722233.post-2756096745880007768Mon, 20 Nov 2017 13:15:00 +00002017-11-20T08:15:00.365-05:00The Grad Student TaxBy now as you've read from <a href="https://lucatrevisan.wordpress.com/2017/11/07/against-a-61-tax-increase-on-berkeley-students/">Luca</a> or <a href="https://www.scottaaronson.com/blog/?p=3542">Scott</a> or <a href="http://www.phdcomics.com/comics.php?f=1985">PhD Comics</a> or a variety of other sources on the dangerous changes to the tax code that passed the US House of Representatives last week. Among a number of university unfriendly policies, the tax code will eliminate the tax exemption for graduate student tuition for students supported with teaching or research duties, nearly every PhD student in STEM fields. The CRA, ACM, IEEE, AAAI, SIAM and Usenix put out a <a href="https://cra.org/govaffairs/wp-content/uploads/sites/6/2017/11/Statement-ComputingCommunity-on-HR1-Provision.pdf">joint statement</a> opposing this tax increase on graduate students. This is real.<br />
<div>
<br /></div>
<div>
Without other changes, a tax on tuition will make grad school unaffordable to most doctoral students. In computer science where potential PhD students can typically get lucrative jobs in industry, we'll certainly see a precipitous drop in those who choose to continue their studies. Universities will have to adjust by lower tuition, if finances and state law allows, and raising stipends. US government science funding will at best remain flat so in almost any scenario we'll see far fewer students pursue PhD degrees particularly in CS and STEM fields. Keep in mind we already don't come close to producing enough CS PhD students entering academia to meet the dramatically growing demand and these moves could frustrate faculty who also might head off to industry.<br />
<br /></div>
<div>
The current senate proposal leaves the exemption in place though no one can predict what will happen the the two bills get reconciled. In the best case scenario this bill goes the same way as the failed health care reform but republicans seem desperate to pass something major this fall. So reach out to <a href="https://www.govtrack.us/congress/members">your representatives</a>, especially your senators, and express the need to leave in the exemption.</div>
http://blog.computationalcomplexity.org/2017/11/the-grad-student-tax.htmlnoreply@blogger.com (Lance Fortnow)5tag:blogger.com,1999:blog-3722233.post-6273080056557737991Thu, 16 Nov 2017 13:42:00 +00002017-11-16T09:01:15.823-05:00A Tale of Three RankingsIn the Spring of 2018 the US News and World Report should release their latest rankings of US graduate science programs including <a href="https://www.usnews.com/best-graduate-schools/top-science-schools/computer-science-rankings">computer science</a>. These are the most cited of the deluge of computer science rankings we see out there. The US News rankings have a long history and since they are reputation based they roughly correspond to how we see CS departments though some argue that reputation changes slowly with the quality of a department.<br />
<br />
US News and World Report also has a new <a href="https://www.usnews.com/education/best-global-universities/computer-science">global ranking</a> of CS departments. The US doesn't fare that well on the list and the ranking of the US programs on the global list are wildly inconsistent with the US list. What's going on?<br />
<br />
75% of the global ranking is <a href="https://www.usnews.com/education/best-global-universities/articles/subject-rankings-methodology">based</a> on statistics from Web of Science. Web of Science captures mainly journal articles where conferences in computer science typically have a higher reputation and more selectivity. In many European and Asian universities hiring and promotion often depend heavily on publications and citations in Web of Science encouraging their professor to publish in journals thus leading to higher ranked international departments.<br />
<br />
The CRA rightly <a href="https://cra.org/cra-statement-us-news-world-report-rankings-computer-science-universities/">put out a statement</a> urging the CS community to ignore the global rankings, though I wished they made a distinction between the two different US News rankings.<br />
<br />
I've <a href="http://blog.computationalcomplexity.org/2014/10/metrics-in-academics.html">never been a fan</a> of using metrics to rank CS departments but there is a relatively new site, Emery Berger's <a href="http://csrankings.org/#">Computer Science Rankings</a>, based on the number of publications in major venues. CS Rankings passes the smell test for both their US and global lists and is relatively consistent with the US News reputation-based CS graduate rankings.<br />
<br />
Nevertheless I hope CS Rankings will not become the main ranking system for CS departments. Departments who wish to raise their ranking would hire faculty based mainly on their ability to publish large number of papers in major conferences. Professors and students would then focus on quantity of papers and this would in the long run discourage risk-taking long-range research, as well as innovations in improving diversity or educating graduate students.<br />
<br />
As <a href="https://en.wikipedia.org/wiki/Goodhart%27s_law">Goodhart's Law</a> states, "when a measure becomes a target, it ceases to be a good measure". Paradoxically CS Rankings can lead to good rankings of CS departments as long as we don't treat it as such.http://blog.computationalcomplexity.org/2017/11/a-tale-of-three-rankings.htmlnoreply@blogger.com (Lance Fortnow)4tag:blogger.com,1999:blog-3722233.post-194133933116417285Mon, 13 Nov 2017 14:48:00 +00002017-11-13T16:19:34.281-05:00Can you measure which pangrams are naturalA Pangram is a sentence that contains every letter of the alphabet<br />
<br />
The classic is:<br />
<br />
The quick brown fox jumps over the lazy dog.<br />
<br />
(NOTE- I had `jumped' but a reader pointed out that there was no s, and that `jumps' is the correct word)<br />
<br />
which is only 31 letters.<br />
<br />
I could give a pointer to lists of such, but you can do that yourself.<br />
<br />
My concern is:<br />
<br />
a) are there any pangrams that have actually been uttered NOT in the context of `here is a pangram'<br />
<br />
b) are there any that really could.<br />
<br />
That is- which pangrams are natural? I know this is an ill defined question.<br />
<br />
Here are some candidates for natural pangrams<br />
<br />
1) Pack my box with five dozen liquor jugs<br />
<br />
2) Amazingly few discotheques provide jukeboxes<br />
<br />
3) Watch Jeopardy! Alex Trebek's fun TV quiz game<br />
<br />
4) Cwm fjord bank glyphs vext quiz<br />
(Okay, maybe that one is not natural as it uses archaic words. It means<br />
``Carved symbols in a mountain hollow on the bank of an inlet irritated an<br />
eccentric person' Could come up in real life. NOT. It uses every letter<br />
exactly once.)<br />
<br />
How can you measure how natural they are?<br />
<br />
For the Jeopardy one I've shown it to people and asked them<br />
<br />
``What is unusual about this new slogan for the show Jeopardy?''<br />
<br />
and nobody gets it. more important- they believe it is the new slogan.<br />
<br />
So I leave to the reader:<br />
<br />
I) Are the other NATURAL pangrams?<br />
<br />
II) How would you test naturalness of such?<br />
<br />
Pinning down `natural' is hard. I did a guest post in 2004 before I was an official co-blogger, about when a problem (a set for us) is natural, for example the set all regular expressions with squaring (see <a href="http://blog.computationalcomplexity.org/2004/10/conversations-with-bill.html">here</a>).http://blog.computationalcomplexity.org/2017/11/can-you-measure-which-panagrams-are.htmlnoreply@blogger.com (GASARCH)10tag:blogger.com,1999:blog-3722233.post-3201705923730570660Thu, 09 Nov 2017 19:08:00 +00002017-11-09T14:08:38.120-05:00Advice for the Advisor<div class="tr_bq">
A soon-to-be professor asked me recently if I could share some ideas on on how to advise students. I started to write some notes only to realize that I had already <a href="http://blog.computationalcomplexity.org/2006/02/advising.html">posted on the topic</a> in 2006.</div>
<blockquote>
Have students work on problems that interest them not just you. I like to hand them a proceedings of a recent conference and have them skim abstracts to find papers they enjoy. However if they stray too far from your research interests, you will have a hard time pushing them in the right directions. And don't work on their problems unless they want you to.<br />Keep your students motivated. Meet with them on a regular basis. Encourage students to discuss their problems and other research questions with other students and faculty. Do your best to keep their spirits high if they have trouble proving theorems or are not getting their papers into conferences. Once they lose interest in theory they won't succeed.<br />Feel free to have them read papers, do some refereeing and reviewing, give talks on recent great papers. These are good skills for them to learn. But don't abuse them too much.<br />Make sure they learn that selling their research is as important as proving the theorems. Have them write the papers and make them rewrite until the paper properly motivates the work. Make them give practice talks before conferences and do not hold back on the criticism.<br />Some students will want to talk about some personal issues they have. Listen as a friend and give some suggestions without being condescending. But if they have a serious emotional crisis, you are not trained for that; point them to your university counseling services.<br />Once it becomes clear a student won't succeed working with you, or won't succeed as a theorist or won't succeed in graduate work, cut them loose. The hardest thing to do as an advisor is to tell a student, particular one that tries hard, that they should go do something else. It's much easier to just keep them on until they get frustrated and quit, but you do no one any favors that way.</blockquote>
Computer science evolves dramatically but the basic principles of advising don't. This advise pretty much works now as well as it did in 2006, in the 80's when I was in the student or even the 18th century. Good advising never goes out of style.<br />
<br />
Of course I don't and can't hand out a physical proceedings to a student to skim. Instead I point to on-line proceedings but browsing just doesn't have the same feel.<br />
<br />
Looking back I would add some additional advice. Push your students and encourage them to take risks with their research. If they aren't failing to solve their problems, they need to try harder problems. We too often define success by having your paper accepted into a conference. Better to have an impact on what others do.<br />
<br />
Finally remember that advising doesn't stop at the defense. It is very much a parent-child relationship that continues long after graduation. Your legacy as a researcher will eventually come to an end. Your legacy as an advisor will live on through those you advise and their students and so on to eternity.http://blog.computationalcomplexity.org/2017/11/advice-for-advisor.htmlnoreply@blogger.com (Lance Fortnow)2tag:blogger.com,1999:blog-3722233.post-6405507601213025133Mon, 06 Nov 2017 16:44:00 +00002017-11-06T11:44:56.895-05:00The two fears about technology- one correct, one incorrect<br />
When the luddites smashed loom machines their supporters (including Lord Byron, Ada Lovelaces father) made two arguments in favor of the luddites (I am sure I am simplifying what they said):<br />
<br />
<ol>
<li>These machines are tossing people out of work NOW and this is BAD for THOSE people. In this assertion they were clearly correct. (`lets just retrain them' only goes so far).</li>
<li>This is bad for mankind! Machines displacing people will lead to the collapse of civilization! Mankind will be far worse off because of technology. In this assertion I think they were incorrect. That is, I think civilization is better off now because of technology. (If you disagree leave an intelligent polite comment. Realize that just be leaving a comment you are using technology. That is NOT a counterargument. I don't think its even IRONY. Not sure what it is.) </li>
<li>(This third one is mine and its more of a question) If you take the human element out of things then bad things will happen. There was a TV show where a drone was going to be dropped on something but a HUMAN noticed there were red flowers on the car and deduced it was a wedding so it wasn't dropped. Yeah! But I can equally well see the opposite: a computer program notices things that indicate its not the target that a person would have missed. But of course that would make as interesting a story. More to the point- if we allow on computers to make decisions without the human elemnet, is that good or bad? For grad admissions does it get rid of bias or does it reinforce bias? (See the book <a href="https://www.amazon.com/Weapons-Math-Destruction-Increases-Inequality/dp/0553418815">Weapons of Math Destruction</a> for an intelligent argument against using programs for, say, grad admissions and other far more important things.)</li>
</ol>
I suspect that the attitude above greeted every technology innovation. For AI there is a similar theme but with one more twist: The machines will eventually destroy us! Bill Gates and Steven Hawkings have expressed views along these lines.<br />
<br />
When Deep Blue beat Kasparov in chess there were some articles about how this could be the end of mankind. That's just stupid. For a more modern article on some of the dangers of AI (some reasonable some not) see <a href="http://nymag.com/daily/intelligencer/2015/05/jeopardy-robot-watson.html">this article on watson.</a><br />
<br />
It seems to me that AI can do some WELL DEFINED (e.g., chess) very well, and even some not-quite-so-well-defined things (Nat Lang translation) very well, but the notion that they will evolve to be `really intelligent' (not sure that is well defined) and think they are better than us and destroy us seems like bad science fiction (or good science fiction).<br />
<br />
Watson can answer questions very very well, Medical diagnosis machines may well be much better than doctors. While this may be bad news for Ken Jennings and for doctors, I don't see it being bad for humanity in the long term. Will we one day look at the fears of AI and see that they were silly--- the machines did not, terminator-style, turn against us? I think so. And of course I hope so. <br />
<br />
<br />
<br />http://blog.computationalcomplexity.org/2017/11/the-two-fears-about-technology-one.htmlnoreply@blogger.com (GASARCH)9tag:blogger.com,1999:blog-3722233.post-3111755148931964191Thu, 02 Nov 2017 14:44:00 +00002017-11-02T10:44:09.010-04:00Matching and ComplexityGiven a group of people, can you pair them up so that each pair are Facebook friends with each other? This is the famous perfect matching problem. The complexity of matching has a rich history which got a little richer in the past few months.<br />
<br />
For bipartite graphs (consider only friendships between men and women), we have had fast matching algorithms since the 1950's via augmenting paths. In the 1965 classic paper, <a href="http://web.eecs.umich.edu/~pettie/matching/Edmonds-paths-trees-flowers.pdf">Path, Trees and Flowers</a>, Jack Edmonds gives a polynomial-time algorithm for matching on general graphs. This paper also laid out an argument for polynomial-time as efficient computation that would lead to the complexity class P (of P v NP fame).<br />
<br />
After Razborov <a href="https://doi.org/10.1007/BF01157687">showed</a> that the clique problem didn't have polynomial-size monotone circuits, his proof techniques also showed that matching didn't have polynomial-size monotone circuits and Raz and Wigderson <a href="https://doi.org/10.1145/146637.146684">show</a> that matching requires exponential size and linear depth. Because of Edmond's algorithm matching does have polynomial-size circuits in general. NOTs are very powerful.<br />
<br />
Can one solve matching in parallel, say the class NC (Nick's class after Pippenger) of problems computable by a polynomial number of processors in polylogarithmic time? Karp, Upfal and Wigderson <a href="https://doi.org/10.1007/BF02579407">give</a> a randomized NC algorithm for matching. Mulmuley, Vazirani and Vazirani <a href="https://doi.org/10.1145/28395.383347">prove</a> an isolation lemma that allows a randomized reduction of matching to the determinant. Howard Karloff <a href="https://doi.org/10.1007/BF02579264">exhibited</a> a Las Vegas parallel algorithm, i.e., never makes a mistake and runs in expected polylogarithmic time.<br />
<br />
Can one remove the randomness? An NC algorithm for matching remains elusive but this year brought two nice results in that direction. Ola Svensson and Jakub Tarnawski <a href="https://arxiv.org/abs/1704.01929">give</a> a quasi-NC algorithm for general graph matching. Quasi-NC means a quasipolynomial (2<sup>polylog</sup>) number of processors. Nima Anari and Vijay Vazirani <a href="https://arxiv.org/abs/1709.07822">give</a> an NC algorithm for matching on planar graphs.<br />
<br />
Matching is up there with primality, factoring, connectivity, graph isomorphism, satsfiability and the permanent as fixed algorithm problems that have played such a large role in helping us understand complexity. Thanks matching problem and may you find NC nirvana in the near future.http://blog.computationalcomplexity.org/2017/11/matching-and-complexity.htmlnoreply@blogger.com (Lance Fortnow)3tag:blogger.com,1999:blog-3722233.post-2987331440027365808Tue, 31 Oct 2017 12:17:00 +00002017-10-31T08:17:05.555-04:00The k=1 case is FUN, the k=2 case is fun, the k\ge 3 case is... you decide. (All of the math in this post is in <a href="http://www.cs.umd.edu/~gasarch/BLOGPAPERS/streaming.pdf">here</a>.)<br />
<br />
<br />
The following problem can be given as a FUN recreational problem to HS students or even younger: (I am sure that many of you already know it but my point is how to present it to HS students and perhaps even younger.)<br />
<br />
Alice will say all but ONE of the elements of {1,...,10<sup>10</sup>}in some order.<br />
<br />
Bob listens with the goal of figuring out the number. Bob cannot possibly store 10<sup>10</sup> numbers in his head. Help Bob out by giving him an algorithm which will not make his head explode.<br />
<br />
This is an easy and fun puzzle. The answer is in the writeup I point to above.<br />
<br />
The following variant is a bit harder but a bright HS student could get it: Same problem except that Alice leaves out TWO numbers.<br />
<br />
The following variant is prob more appropriate for a HS math competition than for a FUN gathering of HS students: Same problem except that Alice leaves out THREE numbers.<br />
<br />
The following variant may be easier because its harder: Alice leaves out k numbers, k a constant. Might be easier then the k=3 case since the solver knows to NOT use properties of 3.<br />
<br />
I find it interesting that the k=1, k=2, and k≥ 3 cases are on different levels of hardness. I would like a more HS answer to the k≥ 3 case.<br />
<br />http://blog.computationalcomplexity.org/2017/10/the-k1-case-is-fun-k2-case-is-fun-kge-3.htmlnoreply@blogger.com (GASARCH)7tag:blogger.com,1999:blog-3722233.post-8778502695975753930Thu, 26 Oct 2017 15:04:00 +00002017-10-26T11:04:27.780-04:002017 Fall Jobs PostYou're finishing up grad school or a postdoc and ask yourself what should I do for the rest of my life? We can't answer that for you but we can help you figure out your options in the annual fall jobs post. We focus mostly on the academic jobs. You could work in industry but there's nothing like choosing your own research directions and working directly with students and taking pride in their success.<br />
<br />
For computer science faculty positions best to look at the ads from the <a href="http://www.cra.org/ads/">CRA</a> and the <a href="http://jobs.acm.org/">ACM</a>. For theoretical computer science specific postdoc and faculty positions check out <a href="https://cstheory-jobs.org/">TCS Jobs</a> and <a href="http://dmatheorynet.blogspot.com/">Theory Announcements</a>. <a href="https://engineering.academickeys.com/seeker_search.php?q=&advanced=1&job%5Bremote_position%5D=&form%5Bfield_IDXs%5D%5B%5D=10&job%5Bctry%5D=&job%5Bdistance%5D=50&job%5Bpostal_code%5D=">AcademicKeys</a> also lists a number of CS jobs. If you have jobs to announce, please post to the above and/or feel free to leave a comment on this post.<br />
<br />
It never hurts to check out the webpages of departments or to contact people to see if positions are available. Even if theory is not listed as a specific hiring priority you may want to apply anyway since some departments may hire theorists when other opportunities to hire dry up. Think global--there are growing theory groups around the world and in particular many have postdoc positions to offer.<br />
<br />
The computer science job market remains hot with most CS departments trying to hire multiple faculty. Many realize the importance of having a strong theory group, but it doesn't hurt if you can tie your research to priority areas like big data, machine learning and security.<br />
<br />
Remember in your research statement, your talk and your interview you need to sell yourself as a computer scientist, not just a theorist. Show interest in other research areas and, especially in your 1-on-1 meetings, find potential ways to collaborate. Make the faculty in the department want you as a colleagues not just someone hiding out proving theorems.<br />
<br />
Good luck to all on the market and can't wait for our Spring 2017 jobs post to see where you all end up.http://blog.computationalcomplexity.org/2017/10/2017-fall-jobs-post.htmlnoreply@blogger.com (Lance Fortnow)22tag:blogger.com,1999:blog-3722233.post-7903477008454080355Mon, 23 Oct 2017 15:56:00 +00002017-10-24T12:22:59.822-04:00Open: PROVE the pumping and reductions can't prove every non-reg lang non-reg.Whenever I post on regular langs, whatever aspect I am looking at, I get a comment telling me that we should stop proving the pumping lemma (and often ask me to stop talking about it) and have our students prove things not regular by either the myhill-nerode theorem or by kolm complexity. I agree with these thoughts pedagogically but I am curious:<br />
<br />
<i>Is there a non-reg lang L such that you CANNOT prove L non-reg via pumping and reductions?</i><br />
<i><br /></i>
There are many pumping theorems (one of which is iff so you could use it on all non-reg but you wouldn't want to-- its in the paper pointed to later). I'll pick the most powerful Pumping Lemma that I can imagine teaching a class of ugrads:<br />
<br />
If L is regular then there exists n<sub>0</sub> such that for all w∈ L, |w| ≥ n<sub>0</sub> and all prefixes x' of w<br />
<br />
with |w|-|x'| ≥ n<sub>0</sub> there exists x,y,z such that<br />
<br />
|x| ≤ n<sub>0</sub> <br />
<br />
y is nonempty<br />
<br />
w=x'xyz<br />
<br />
for all i ≥ 0 x'xy<sup>i</sup>z ∈ L<br />
<br />
If this is all we could use then the question is silly: just take<br />
<br />
{ w : number of a's NOT EQUAL number of b's }<br />
<br />
which is not regular but satisfies the pumping lemma above. SO I also allow closure properties. I define (and this differs from my last post--- I thank my readers, some of whom emailed me, for help in clarifying the question)<br />
<br />
A ≤ B<br />
<br />
if there exists a function f such that if f(A) = B then A regular implies B regular<br />
<br />
(e.g., f(A) = A ∩ a<sup>*</sup>b<sup>*</sup> )<br />
<br />
(CORRECTION: Should be B Regular --> A regular. Paul Beame pointed this out in the comments.)<br />
<br />
(CORRECTION- My definition does not work. I need something like what one of the commenters suggested and what I had in a prior blog post. Let CL be a closure function if for all A, if A is<br />
regular than CL(A) is regular. Like f(A) = A cap a*b*. Want a^nb^n \le numb a's = numb b's<br />
via f(A) = A cap a*b*. So want A \le B if there is a closure function f with f(B) = A. )<br />
<br />
<br />
A set B is <i>Easily proven non-reg </i>if either<br />
<div>
<br /></div>
<div>
a) B does not satisfy the pumping lemma, or</div>
<div>
<br /></div>
<div>
b) there exists a set A that does not satisfy the pumping lemma such that A ≤ B.<br />
<br />
OPEN QUESTION (at least open for me, I am hoping someone out there knows the answer)<br />
<br />
Is there a language that is not regular but NOT easily proven non-reg?</div>
<div>
<br /></div>
<div>
<br />
<br />
<br />
Ehrenfeucht, Parikh, Rozenberg in a paper <i>Pumping Lemmas for Regular Sets</i> (I could not find the official version but I found the Tech Report on line: <a href="http://www.cs.colorado.edu/department/publications/reports/docs/CU-CS-155-79.pdf">here</a>. Ask your grandparents what a Tech report is. Or see this post: <a href="http://blog.computationalcomplexity.org/2006/10/what-happened-to-departmental-tech.html">here</a>) from Lance about Tech Reports) proved an iff pumping lemma. They gave as their motivating example an uncountable number of languages that could not be proved non-regular even with a rather fancy pumping lemma. But there lang CAN be easily proven non-reg. I describe that <a href="https://www.cs.umd.edu/users/gasarch/BLOGPAPERS/notpump.pdf">here</a>. (This is the same paper that proves and iff Pumping Lemma. It uses Ramsey Theory so I should like it. Oh well.)<br />
<br />
SO, I looked around for candidates for non-reg languages that could not be easily proven non-regular. The following were candidates but I unfortunately(?) found ways to prove them non-regular using PL and Closure (I found the ways by asking some bright undergraduates, to give credit- Aaron George did these.)<br />
<br />
{ a<sup>i</sup>b<sup>j</sup> : i and j are relatively prime }<br />
<br />
{xx<sup>R</sup>w : x,w nonempty } where R is Reverse.<br />
<br />
I leave it to the reader to prove these are easily proven non-regular.<br />
<br />
To re-iterate my original question: Find a non-reg lang that is not easily proven non-reg.<br />
<br />
<i>Side Question-</i> my definition of reduction seems a bit odd in that I am defining it the way I want it to turn out. Could poly-Turing reduction have been defined as A ≤ B iff if A is in P then B is in P? Is that equivalent to the usual definition? Can I get a more natural definition for my regular reductions?<br />
<br />
<br />
<br />
<br /></div>
http://blog.computationalcomplexity.org/2017/10/open-prove-pumping-and-reductions-cant.htmlnoreply@blogger.com (GASARCH)13tag:blogger.com,1999:blog-3722233.post-8939250840482814739Thu, 19 Oct 2017 13:15:00 +00002017-10-19T12:06:44.048-04:00The Amazon Gold Rush<div class="separator" style="clear: both; text-align: center;">
</div>
<div class="separator" style="clear: both; text-align: center;">
<a href="https://www.enterprise.com/content/dam/ecom/locations/us/ga/atlanta/city-hero-atlanta.jpg" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" data-original-height="292" data-original-width="800" height="145" src="https://www.enterprise.com/content/dam/ecom/locations/us/ga/atlanta/city-hero-atlanta.jpg" width="400" /></a></div>
<br />
Unless you have hidden under a rock, you've heard that Amazon wants to build a <a href="https://www.amazon.com/b?ie=UTF8&node=17044620011">second headquarters</a> in or near a large North American city. Amazon put out a nice old fashioned <a href="https://images-na.ssl-images-amazon.com/images/G/01/Anything/test/images/usa/RFP_3._V516043504_.pdf">RFP</a>.<br />
<blockquote class="tr_bq">
Please provide an electronic copy and five (5) hard copies of your responses by October 19, 2017 to amazonhq2@amazon.com. Please send hard copies marked “confidential” between the dates of October 16th – 19th to ...</blockquote>
Hard copies? Just like the conference submissions of old. Key considerations for Amazon: A good site, local incentives, highly education labor pool and strong university system, near major highways and airports, cultural community fit and quality of life.<br />
<br />
I've seen companies put subsidiaries in other cities, or moved their headquarters away from their manufacturing center, like when Boeing moved to Chicago. But building a second headquarters, "a full equal" to their Seattle campus, seems unprecedented for a company this size. Much like a company has only one CEO or colleges have one President, having two HQs questions where decisions get made. Amazon is not a typical company and maybe location means less these days.<br />
<br />
Atlanta makes many short lists. We've got a burgeoning tech community, a growing city, sites with a direct train into the world's busiest airport, good weather, low cost of living and, of course, great universities. Check out the <a href="http://www.gatech.edu/techlanta">Techlanta</a> and <a href="http://www.chooseatl.com/">ChooseATL</a>.<br />
<br />
So am I using Amazon's announcement as an excuse to show off Atlanta? Maybe. But winning the Amazon HQ2 would be transformative to the city, not only in the jobs it would bring, but in immediately branding Atlanta as a new tech hub. Atlanta will continue to grow whether or not Amazon comes here but high profile wins never hurt.<br />
<br />
Many other cities make their own claims on Amazon and I have no good way to judge this horse race (where's the prediction market?). Impossible to tell how Amazon weighs their criteria and it may come to which city offers the best incentives. Reminds me of the Simons Institute Competition <a href="http://blog.computationalcomplexity.org/2010/08/new-institute-for-theory-of-computing.html">announced</a> in 2010 (<a href="https://simons.berkeley.edu/">Berkeley won</a>) though with far larger consequences.http://blog.computationalcomplexity.org/2017/10/the-amazon-gold-rush.htmlnoreply@blogger.com (Lance Fortnow)4tag:blogger.com,1999:blog-3722233.post-6386185179971179894Mon, 16 Oct 2017 15:59:00 +00002017-10-16T11:59:56.569-04:00Reductions between formal languages<br />
Let EQ = {w : number of a's = number of b's }<br />
<br />
Let EQO = { a<sup>n</sup>b<sup>n</sup> : n ∈ N} (so its Equal and in Order)<br />
<br />
Typically we do the following:<br />
<br />
Prove EQO is not regular by the pumping lemma.<br />
<br />
Then to show EQ is not regular you say: If EQ was regular than EQ INTERSECT a*b*= EQO is regular, hence EQ is not regular (I know you can also show EQ with the Pumping Lemma but thats not important now.)<br />
<br />
One can view this as a reduction:<br />
<br />
A ≤ B<br />
<br />
If one can take B, apply a finite sequence of closure operations (e.g., intersect with a regular lang,<br />
complement, replace all a with aba, replace all a with e (empty string), ) and get A.<br />
<br />
If A is not regular and A≤ B then B is not regular.<br />
<br />
Note that<br />
<br />
EQO ≤ EQ ≤ <span style="text-decoration: overline;">EQ</span><br />
<br />
Since EQO is not regular (by pumping ) we get EQ and \overline{EQ} are not regular.<br />
<br />
Hence we could view the theory of showing things not-reg like the theory of NP completeness<br />
with reductions and such. However, I have never seen a chain of more than length 2.<br />
<br />
BUT- consider the following! Instead of using Pumping Lemma we use Comm. Comp. I have<br />
been able to show (and this was well known) that<br />
<br />
EQ is not regular by using Comm. Comp:<br />
<br />
EQH = { (x,y) : |x|=|y| and number of a's in xy = number of b's in xy }<br />
<br />
Comm Complexity of EQH is known to be log n + \Theta(1). Important- NOT O(1).<br />
<br />
If EQ is regular then Alice and Bob have an O(1) protocol: Alice runs x through the DFA and<br />
transmits to Bob the state, then Bob runs y from that state to the end and transmits 1 if ended up in an accept state, 0 if not.<br />
<br />
But I was not able to show EQO is not regular using Comm Complexity. SO imagine a bizzaro world where I taught my students the Comm Comp approach but not the Pumping Lemma. Could they prove that EQO is not regular. For one thing, could they prove<br />
<br />
EQO ≤ EQ ?<br />
<br />
Or show that this CANNOT be done.<br />
<br />
Anyone know?<br />
<br />
One could also study the structure of the degrees induced by the equiv classes.<br />
If this has already been done, let me know in the comments.<br />
<br />
<br />
<br />
<br />
<br />
<br />http://blog.computationalcomplexity.org/2017/10/reductions-between-formal-languages.htmlnoreply@blogger.com (GASARCH)5tag:blogger.com,1999:blog-3722233.post-7344371022223643761Thu, 12 Oct 2017 12:52:00 +00002017-10-12T08:52:56.299-04:00Lessons from the Nobel PrizesWe've had a big week of awards with the <a href="https://www.nobelprize.org/nobel_prizes/lists/year/index.html?year=2017&images=yes">Nobel Prizes</a> and the <a href="https://www.macfound.org/programs/fellows/">MacArthur "Genius" Fellows</a>. The MacArthur Fellows include two computer scientists, <a href="https://www.macfound.org/fellows/983/">Regina Barzilay</a> and <a href="https://www.macfound.org/fellows/998/">Stefan Savage</a>, and a statistician <a href="https://www.macfound.org/fellows/985/">Emmanuel Candès</a> but no theoretical computer scientists this year.<br />
<div>
<br />
No computer scientists among the Nobel Laureates either but technology played a large role in the chemistry and physics prize. The <a href="https://www.nobelprize.org/nobel_prizes/chemistry/laureates/2017/">chemistry prize</a> went for a fancy microscope that could determine biomolecular structure. The LIGO project that measures extremely weak gravitational waves received the <a href="https://www.nobelprize.org/nobel_prizes/physics/laureates/2017/">physics prize</a>.<br />
<br />
In a sign of the times, Jeffrey Hall, one of the <a href="https://www.nobelprize.org/nobel_prizes/medicine/laureates/2017/">medical prize</a> recipients, <a href="http://www.independent.co.uk/news/world/americas/nobel-prize-medicine-winner-2017-jeffrey-hall-left-science-lack-of-funding-biological-clocks-a7986441.html">left science</a> due to lack of funding.<br />
<br />
The <a href="https://www.nobelprize.org/nobel_prizes/economic-sciences/laureates/2017/">economics prize</a> went to Richard Thaler who described how people act irrationally but often in predictable ways such as the endowment effect that states the people give more value to an object they own versus one they don't currently have. The book <a href="http://amzn.to/2yjbqaI">Thinking Fast and Slow</a> by 2002 Laureate Daniel Kahneman does a great job describing these behaviors.<br />
<br />
While at Northwestern I regularly attended the micro-economics seminars many of which tried to give models that described the seemingly irrational behaviors that researchers like Thaler brought to light. My personal theory: Humans evolved to have these behaviors because while they might not be the best individual choices they make society better overall.</div>
http://blog.computationalcomplexity.org/2017/10/lessons-from-nobel-prizes.htmlnoreply@blogger.com (Lance Fortnow)4