tag:blogger.com,1999:blog-3722233Wed, 25 Apr 2018 10:36:08 +0000typecastfocs metacommentsComputational ComplexityComputational Complexity and other fun stuff in math and computer science from Lance Fortnow and Bill Gasarchhttps://blog.computationalcomplexity.org/noreply@blogger.com (Lance Fortnow)Blogger2575125tag:blogger.com,1999:blog-3722233.post-6882571169428038992Mon, 23 Apr 2018 15:56:00 +00002018-04-23T11:56:45.674-04:00Find an 8-digits number such that ....(June 29th, co-located with STOC, will be a workshop to celebrate Vijay Vazarani's 60th birthday. As computer scientists shouldn't we use 64 as the milestone? See <a href="https://www.cs.umd.edu/users/samir/stoc2018/">here</a> for details about the workshop, not about 60 vs 64.)<br />
<br />
I will likely post a lot about Gathering For Gardner 13, but for now I will just give one problem I saw there. I will not say the speaker or the title of the talk as that might be a clue. I'll give the answer in my next post which will be this week<br />
<br />
<br />
Find an 8-digit number<br />
<br />
d_7 d_6 d_5 d_4 d_3 d_2 d_1 d_0<br />
<br />
such that<br />
<br />
d_0 is the number of 0's in the number<br />
<br />
d_1 is the number of 1's in the number<br />
<br />
d_2 is the number of 2's in the number<br />
<br />
.....<br />
<br />
d_6 is the number of 6's in the number<br />
<br />
but<br />
<br />
d_7 is NOT necc the number of 7's<br />
<br />
d_7 is the number of DISTINCT DIGITS in d_7 d_6 d_5 d_4 d_3 d_2 d_1 d_0<br />
<br />
You could prob find such a number by computer search- but don't.<br />
<br />
Feel free to comment. I will not block comments (except those we usually block- usually spam) but by the same token, if you don't want hints, don't read the comments.<br />
<br />
<br />https://blog.computationalcomplexity.org/2018/04/find-8-digits-number-such-that.htmlnoreply@blogger.com (GASARCH)7tag:blogger.com,1999:blog-3722233.post-1823496575543826252Thu, 19 Apr 2018 11:42:00 +00002018-04-19T07:42:08.214-04:00Memory is Hot<div class="separator" style="clear: both; text-align: center;">
<a href="https://4.bp.blogspot.com/-F8VKllvkIEw/WtZGktrPqgI/AAAAAAABf9g/e8z_dKQ6FFgdDR8lzG612cN1iEPauzW7QCLcBGAs/s1600/cross_point_image_for_photo_capsule.jpg" imageanchor="1" style="clear: left; float: left; margin-bottom: 1em; margin-right: 1em;"><img border="0" data-original-height="690" data-original-width="690" height="200" src="https://4.bp.blogspot.com/-F8VKllvkIEw/WtZGktrPqgI/AAAAAAABf9g/e8z_dKQ6FFgdDR8lzG612cN1iEPauzW7QCLcBGAs/s200/cross_point_image_for_photo_capsule.jpg" width="200" /></a></div>
A good number of the faculty candidates interviewing at Georgia Tech have a common theme: Memory. Memory connected to databases, to programming languages, to architecture, to operating systems, to networks and in security. Why all the interest in memory?<br />
<br />
I started asking the candidates. The short answer: We no longer get faster performance from the CPU but new memory technologies can make a large difference.<br />
<br />
Intel and Micron developed a new memory technology they call 3D XPoint ("3D Cross-Point") as diagrammed above, with the memory, in yellow, addressable by choosing the adjacent horizontal and vertical bars. 3D XPoint gives fully bit addressable high-density high-speed non-volatile memory without transistors or electrons. Non-volatile means the memory does not disappear when the power goes off, like a "flash" drive. Intel has announced a 3D XPoint main memory card under the <a href="https://www.intel.com/content/www/us/en/architecture-and-technology/intel-optane-technology.html">Optane</a> brand available this fall. One could use this memory as a full replacement or in conjunction with traditional DRAM in a heterogeneous system.<br />
<br />
What's the big deal? The non-volatility means we can reduce power needed for memory, power being perhaps the biggest bottleneck in computing today. We can have large-scale databases in memory, fast performance with quick crash recovery since the memory isn't lost. 3D XPoint can enable edge or fog computing that brings the power of the cloud closer to the user for applications like virtual reality or self-driving cars where the time to reach a data center can cause unacceptable lag. Like most transformative technologies it will bring opportunities and challenges we can't even imagine now.<br />
<br />
As theorists we need to take a leading role. How can we model 3D XPoint-like memories so we can properly develop algorithms and analyze complexity to understand what these memories can or cannot enable? Theoretical Computer Science can play a large role in adapting to new technologies if it is willing to get into the game.https://blog.computationalcomplexity.org/2018/04/memory-is-hot.htmlnoreply@blogger.com (Lance Fortnow)3tag:blogger.com,1999:blog-3722233.post-4479577380123454466Mon, 16 Apr 2018 23:03:00 +00002018-04-16T20:53:24.486-04:00Is DTIME(n) closed under concat? star? of course not but...(STOC 2018 will offer child care for the first time. I was emailed the following and asked to<br />
pass it on:<br />
<br />
We are pleased to announce that we will provide pooled, subsidized<br />
child care at STOC 2018. The cost will be $40 per day per child for<br />
regular conference attendees, and $20 per day per child for students.<br />
For more detailed information, including how to register for STOC 2018<br />
childcare, see <a href="http://acm-stoc.org/stoc2018/childcare.html">http://acm-stoc.org/stoc2018/childcare.html</a><br />
<br />
Ilias Diakonikolas and David Kempe (local arrangements chairs)<br />
<br />
I tell my class that poly time is nice mathematically since its closed under lots of operations including<br />
concat and *. That is:<br />
<br />
L<sub>1</sub> , L<sub>2</sub> ∈ P implies L<sub>1</sub> L<sub>2</sub> ∈ P.<br />
<br />
unlike DTIME(n) which, as you can see, is NOT closed under concat! After all, the proof that P is closed under concat uses that if p(n) is a poly then np(n) is a poly which does not hold for linear time. If p(n) is O(n) then np(n) is NOT necc O(n).<br />
<br />
But--- thats not a proof that DTIME(n) is not closed under concat! Thats just the observation that the argument for P being closed under concat does not extend to DTIME(n). Perhaps some other argument does.<br />
<br />
I do not believe that. I believe there exists L<sub>1</sub> , L<sub>2</sub> ∈ DTIME(n) such that L<sub>1</sub> L<sub>2</sub> is not in DTIME(n).<br />
<br />
I have not been able to prove this. In fact, the question I pose is not well defined since I need to specify a machine model.<br />
<br />
I pose the following question which may well be known - if so then please leave a comment:<br />
<br />
Find a reasonable machine model (RAM? k-tape TM?) such that DTIME(n) on that model is NOT closed under concat. (Prob use DTIME(O(n))).<br />
<br />
Similar for *<br />
<br />
These are likely hard questions since if L is in DTIME(n) then L* is in NTIME(n), (similar for concat),<br />
so I would be separating DTIME(n) from NTIME(n), which HAS been done, but not with nice natural problems of the type that I seek.https://blog.computationalcomplexity.org/2018/04/is-dtimen-closed-under-concat-star-of.htmlnoreply@blogger.com (GASARCH)1tag:blogger.com,1999:blog-3722233.post-3285440561988482884Fri, 13 Apr 2018 12:01:00 +00002018-04-13T08:01:01.929-04:00Lance and Bill Gather for GardnerEvery two years in Atlanta, recreational mathematicians gather to honor Martin Gardner, whose Scientific American column Mathematical Games through the 60's and the 70's. Those columns inspired budding mathematicians of a certain age including Bill and I.<br />
<br />
Bill came down to this years <a href="http://www.gathering4gardner.org/g4g13-information/">Gathering for Gardner 13</a>. Talks are only six minutes long. Bill talked on the <a href="https://arxiv.org/abs/1709.02452">Muffin Problem</a> right after an 8-year old and right before Stephan Wolfram.<br />
<br />
We also did a short <a href="https://youtu.be/gZtTeGBlOzU">vidcast</a> from the exhibition room.<br />
<br />
<iframe allow="autoplay; encrypted-media" allowfullscreen="" frameborder="0" height="315" src="https://www.youtube.com/embed/gZtTeGBlOzU" width="560"></iframe>https://blog.computationalcomplexity.org/2018/04/lance-and-bill-gather-for-gardner.htmlnoreply@blogger.com (Lance Fortnow)3tag:blogger.com,1999:blog-3722233.post-4480549433045489957Mon, 09 Apr 2018 05:26:00 +00002018-04-09T20:35:45.602-04:00Whan a deep theorem of your Uncles becomes standard should you be sad?(An exposition of Nash-Williams's proof of the Kruskal Tree Theorem is <a href="https://www.cs.umd.edu/users/gasarch/BLOGPAPERS/ktt.pdf">here</a>)<br />
<br />
Andrew Vazsonyi (the mathematician, see <a href="https://en.wikipedia.org/wiki/Andrew_V%C3%A1zsonyi#cite_note-15">here</a>, not the folklorist, see <a href="https://en.wikipedia.org/wiki/Linda_D%C3%A9gh">here</a> for that folklorist's wife) conjectured that the set of trees, under the minor ordering, is a well quasi order. I do not know when he made the conjecture, but he was born in 1916 and the conjecture was solved in 1960, so you can take a guess based on that. We only know he conjectured it since when Joe Kruskal proved it, he credits Vazsonyi and calls it `Vazonyi's conjecture' I do not know if anyone else ever called it that.<br />
After a conjecture is solved it's usually called by the solvers name, not the poser's name, so it's hard to find out anything about Vazsonyi's conjecture when it was a conjecture.<br />
<br />
Joe Kruskal's proof was quite hard and quite deep (are they necc the same? Prob not). See <a href="http://www.ams.org/journals/tran/1960-095-02/S0002-9947-1960-0111704-1/S0002-9947-1960-0111704-1.pdf">here</a> for that paper. Nash-Williams three years later, in 1963, provided a much easier, though still deep proof. (I could not find a free online copy to point to- if you know of one please email me or comment.) Nash-Williams prove is in my writeup.<br />
<br />
Joe Kruskal is Clyde Kruskal's uncle (Joe is also known in our circles for MST). I told Clyde that I made his Uncle's Theorem a problem on my TAKE HOME midterm in graduate Ramsey Theory. He PONDERED- is it sad that this once great theorem is now merely a problem in a course?<br />
<br />
I asked some random students from both my Ramsey Theory class and my Aut theory class for their take on this. Here are the responses.<br />
<br />
<b>Dolapo</b>: (Aut Student) Clyde should stop worrying about his Uncle's legacy and start building his own!<br />
<br />
<b>Ben: </b> (Ramsey Student) Bill proved in class that SUBSEQUENCE is a wqo. GIVEN that, the problem wasn't that hard. Had he not given it to us the problem would be impossible.<br />
<br />
<b>Clyde: </b>Bill, next time you teach the course give them the problem cold- without any prior theorems about wqo.<br />
<br />
<b>Bill:</b> I'd rather not<br />
<br />
<b>Nishant</b>:(Ramsey Student) Clyde should be happy, and know it, and clap his hands! People are still talking about his Uncle's Theorem!<br />
<br />
<b>Bill</b>: If you're happy and you know it clap your hands! Alice is not clapping here hands. Bob is. What can you deduce about Alice and Bob? Never mind, that will be a different post.<br />
<br />
<b>Bill: </b>If I gave the problem on an i<i>n-class exam</i> in a <i>grad course</i> or a <i>take-home</i> exam in an <i>ugrad</i> course THEN you should be sad. But <i>take-home exam</i> in <i>grad-course</i>. That's just right.<br />
<br />
<b>Ben:</b> (Ramsey Student) When are you going to do a post about this?<br />
<br />
<b>Bill: </b>Since my post will include a pointer to a proof of the Kruskal Tree Theorem, I won't post until after you all hand in your take-home midterms.<br />
<br />
<b>Nishant and Ben together: </b>Darn!<br />
<br />
<b>Joshua (</b>TA for Aut Theory): I heard the grad students complaining about the problem being too hard is a sign of a great mathematician. If your grad students complain then kudos to Joe Kruskal!<br />
<br />
<b>Bill</b>: They Didn't comlain<br />
<br />
<b>Clyde</b>: Darn!<br />
<br />
<b>Ajeet</b> (Ramsey Student) It's much harder to CREATE new math then to LEARN new math. I feel our working out this problem, given what you already gave us, was more a LEARNING thing rather than a CREATE thing. Like P vs NP: easier to verify then generate.<br />
<br />
<b>Katherine</b> (Ramsey Student and Clydes Algorithms TA): A bigger problem for Joe Kruskal's legacy is that people in the algorithms class refer to <i>The Kruskal MST algorithm</i> as <i>Clyde's Algorithm</i>.<br />
<br />
<b>Saddiq </b>(Aut Theory Student) If Clyde can test on Kruskal MST on his final (which he did) then you can test on Krusakl Tree theorem on your midterm (which you did).<br />
<br />
Anyway, one lesson here is that fame is fleeting. Very few people are remembered 100 years after their death. So Clyde - I am helping keep your Uncle's memory alive!<br />
<br />
<b>Clyde: </b>Oh Joy<br />
<br />
SO- what do you think? Should Clyde be happy that his Uncle's theorem is on my take him midterm? Should he know it? Should he clap his hands?<br />
<br />
<br />
<b><br /></b>
https://blog.computationalcomplexity.org/2018/04/whan-deep-theorem-of-your-uncles.htmlnoreply@blogger.com (GASARCH)1tag:blogger.com,1999:blog-3722233.post-3104560555660523151Thu, 05 Apr 2018 14:49:00 +00002018-04-05T10:49:40.477-04:00Challenge about NFA for {a^y : y\ne 1000} answered.<br />
Recall that in a prior post I asked<br />
<br />
Is there an NFA for { a<sup>y</sup> : y ≠ 1000 } with substantially less than 1000 states.<br />
<br />
I will now show that any NFA for this set requires 999 states, so essntially 1000. The proof uses Ramsey Theory. I will tell you the little bit of Ramsey Theory that you need.<br />
<br />
NO- the above is false.<br />
<br />
There is an NFA with 60 states. I have a complete exposition <a href="https://www.cs.umd.edu/users/gasarch/BLOGPAPERS/1000.pdf">here</a> and I have a paper (with coauthors) on cofinite unary languages and NFA's <a href="https://www.cs.umd.edu/users/gasarch/BLOGPAPERS/nfa.pdf">here</a>). Generally if you want to only avoid<br />
a<sup>n</sup> the NFA an be done in sqrt(n) + O(\log n) states, but requires sqrt(n) states.<br />
<br />
I sketch the ideas here for the 1000.<br />
<br />
Convention- `reject 988' would mean rejecting a<sup>988</sup>.<br />
<br />
It is easy show the following:<br />
For all n \ge 992 there exists x,y\in N such that n = 32x +33y<br />
<br />
For all x,y 32x+ 33y is NOT = 991.<br />
<br />
If you have an NFA with a 33-loop and a shortcut so you can also to 32 and back to the start<br />
state, this NFA<br />
<br />
accepts all y ≥ 992<br />
<br />
rejects 991<br />
<br />
we have no comment on anything else.<br />
<br />
So if you prepend 9 states to that NFA you will have an NFA that<br />
<br />
accepts all y ≥ 1001<br />
<br />
rejects 1000<br />
<br />
How to get all the numbers < 1000?<br />
<br />
Use mod 3, mod 5, mod 7, mod 11 loops that only accept if the number is NOT equiv to 1000<br />
mod 3, 5, 7, 11, Since 3*5*7*11 > 1000 we have<br />
<br />
if y is rejected then y ≤ 1000, but y \equiv 1000 mod 3*5*7*11, so must have y=1000.<br />
<br />
so 1000 is the only reject.<br />
<br />
Number of states: 1 + 33 + 3 + 5 + 7 + 11 = 60 states.<br />
<br />
I think you can do this in 58, but what is the BEST you can do?<br />
My paper has lower bounds of sqrt(n) so in this case 32.<br />
<br />
This is a GREAT theorem to teach to students in a course that covers regular langs and also P vs NP since the students THINK that an NFA cannot do better - AH BUT IT CAN! - so it gives a concrete example of<br />
<br />
<i>lower bounds are hard since someone may come along with a very clever trick you didn't think of</i><br />
<i><br /></i>
This semester when I had the class VOTE on whether or not there was a small NFA<br />
<br />
48 thought that ANY NFA would require around 1000 states<br />
<br />
One of the best students proved this! or perhaps ``proved'' this<br />
<br />
Only 2 students knew that it could be done with MUCH LESS than 1000 states- and those two are exceptions- one is co-author on the paper (and he tells me that he originally thought it required 1000 when I first showed him the problem) and one is someone who often goes to my old course websites looking for more information and problems to work on (I like that ambition!) and came across material on this. <br />
<br />
I tell them `you thought this was the last lecture on reg langs. It was not. it was the first lecture on P vs NP'<br />
<br />
<br />
<br />
<br />
<br />
<br />https://blog.computationalcomplexity.org/2018/04/challenge-about-nfa-for-ay-yne-1000.htmlnoreply@blogger.com (GASARCH)5tag:blogger.com,1999:blog-3722233.post-2632797971954315737Tue, 03 Apr 2018 18:00:00 +00002018-04-04T01:25:43.381-04:00Challenge: Is there a small NFA for { a^i : i\ne 1000} ?<br />
(Added later- a reader left a comment pointing to a paper with the answer and saying that the problem is not original. My apologies- upon rereading I can see why one would think I was claiming it was my problem. It is not. I had heard the result was folklore but now I have a source! So I thank the commenter and re-iterate that I am NOT claiming it is my problem.)<br />
<br />
<br />
Consider the language<br />
<br />
{L = a<sup>i </sup> : i ≠ 1000 }<br />
<br />
There is a DFA for L of size 1002 and one can prove that there is no smaller DFA.<br />
<br />
What about an NFA? Either:<br />
<br />
a) Show that any NFA for L requires roughly 1000 states<br />
<br />
or<br />
<br />
b) Show that there is a small NFA for L, say less than 500 states<br />
<br />
or<br />
<br />
c) State that you think the question is unknown to science.<br />
<br />
I will reveal the answer in my next post, though its possible that (c) is the answer and the comments will convert it to either (a) or (b).<br />
<br />
Feel free to leave comments with your answers. if you want to work on it without other information then do not read the comments.<br />
<br />
<br />
<br />
<br />
<br />
<br />https://blog.computationalcomplexity.org/2018/04/challenge-is-there-small-nfa-for-ai-ine.htmlnoreply@blogger.com (GASARCH)3tag:blogger.com,1999:blog-3722233.post-4794823229628622346Thu, 29 Mar 2018 16:42:00 +00002018-04-01T09:07:40.979-04:00Almost Famous Quantum Polynomial TimeI have been playing with a new complexity class AFQP, defined in a yet-to-be-published manuscript by Alagna and Fleming. A language L is in AFQP if there is a polynomial-time quantum Turing machine Q such that for all inputs x,<br />
<div>
<ul>
<li>If x is in L, then Q(x) accepts with high probability.</li>
<li>If x is not in L, then Q(x) rejects with high probability.</li>
<li>Q(x) only has O(log |x|) quantumly entangled bits as well as a polynomial amount of "deterministic" memory. </li>
</ul>
<div>
AFQP is meant to capture the state of the art of current quantum technology.<br />
<br /></div>
</div>
<div>
AFQP has several nice properties, capturing the complexity of many open problems.</div>
<div>
<ol>
<li>If BQP is in AFQP then factoring is in BPP.</li>
<li>If one can solve satisfiability in AFQP then the polynomial-time hierarchy collapses.</li>
<li>AFQP is contained in the fifth level of the polynomial-time hierarchy.</li>
<li>If AFQP is in log-space then matching has a deterministic NC algorithm.</li>
<li>Graph isomorphism is in a quasi-polynomial time version of AFQP.</li>
<li>AFQP = PPAD iff Nash Equilibrium has solutions we can find in polynomial time.</li>
</ol>
<div>
The proofs use a clever combination of Fourier analysis and semidefinite programming. </div>
</div>
<div>
<br /></div>
<div>
Where does the name AFQP come from? The authors claim that they didn't name the class after themselves, and instead say it stands for "Almost Famous Quantum Polynomial Time" as it won't get the fame of BQP. More likely it is because it's April the first and I'm feeling a bit Foolish making up a new complexity class that is just P in disguise. </div>
https://blog.computationalcomplexity.org/2018/03/almost-famous-quantum-polynomial-time.htmlnoreply@blogger.com (Lance Fortnow)3tag:blogger.com,1999:blog-3722233.post-6028265455445561463Thu, 29 Mar 2018 12:06:00 +00002018-03-29T08:06:25.523-04:00A Reduced Turing Award<div class="separator" style="clear: both; text-align: center;">
</div>
<div class="separator" style="clear: both; text-align: center;">
<a href="https://engineering.stanford.edu/sites/default/files/styles/large-square/public/hennessy_biography_0.jpg?itok=5tbd2-Ds" imageanchor="1" style="clear: left; float: left; margin-bottom: 1em; margin-right: 1em;"><img border="0" data-original-height="270" data-original-width="270" height="200" src="https://engineering.stanford.edu/sites/default/files/styles/large-square/public/hennessy_biography_0.jpg?itok=5tbd2-Ds" width="200" /></a></div>
<a href="https://www2.eecs.berkeley.edu/Faculty/Photos/Homepages/patterson.jpg" imageanchor="1" style="clear: right; float: right; margin-bottom: 1em; margin-left: 1em;"><img border="0" data-original-height="210" data-original-width="150" height="200" src="https://www2.eecs.berkeley.edu/Faculty/Photos/Homepages/patterson.jpg" width="142" /></a>A Turing machine has an extremely simple instruction set: Move left, move right, read and write. If you want to do real programming, you need something a bit more powerful. So computer architects created chips with more and more operations. As an undergrad at Cornell in the early 80's I worked on coding an email system written in IBM 370 assembly language. As I wrote in a <a href="https://blog.computationalcomplexity.org/2011/06/creating-email-system-at-cornell.html">2011 post</a>,<br />
<blockquote class="tr_bq">
IBM Assembly language was quite bloated with instructions. There was a command called "Edit and Mark" that went through a range data making modifications based on some other data. This was a single assembly language instruction. We used to joke that there was a single instruction to do your taxes.</blockquote>
After Cornell I spent one year at Berkeley for graduate school where I heard about this new idea: Let's move in the other direction and have a "reduced instruction set computer". Make the chip as simple as possible to simplify the design, save power and increase performance. Fast forward to last week and ACM <a href="https://www.nytimes.com/2018/03/21/technology/computer-chips-turing-award.html">tapped RISC pioneers John Hennessey and David Patterson for the Turing Award</a>, the highest honor in computer science. They won an award named after the man who created the simplest instruction set of them all.<br />
<br />
RISC didn't take over--Intel never really embraced the concept and kept adding new features from real-number operations to AES encryption/decryption built into the processor. GPUs added vector operations and Tensor Processing Units can do machine learning instructions. Added complexity has its complications such as the famous <a href="https://en.wikipedia.org/wiki/Pentium_FDIV_bug">1994 division bug</a>.<br />
<br />
RISC processors do play a role in mobile devices which need to have low power, one can find ARM (Advanced Risc Machines) processors in many mobile phones and tablets. Based on quantity alone there are far many more RISC processors than CISC (C = complex).<br />
<br />
These days the lines between the processor and the operating systems blur and we are programming chips. David Patterson continues to work on RISC, with a recent open <a href="https://en.wikipedia.org/wiki/RISC-V">RISC-V</a> architecture that also supports chip programming. John Hennessey was otherwise occupied--he was president of Stanford from 2000 to 2016.https://blog.computationalcomplexity.org/2018/03/a-reduced-turing-award.htmlnoreply@blogger.com (Lance Fortnow)5tag:blogger.com,1999:blog-3722233.post-7432331662766960641Mon, 26 Mar 2018 14:04:00 +00002018-03-26T10:04:29.784-04:00Why do we give citations? How should we give citations?<br />
Why do we cite past work? There are many reasons and they lead to advice on how we should cite past work<br />
<br />
<ol>
<li>Give credit where credit it due. Some people over cite and that diminishes any one citation. I once saw a paper that had in the first paragraph: ''Similar work in this field has been done by [list of 20 citations].'' One of the papers in that list was extremely relevent, the rest much less so. This is not really helpful. There should be less citations and more about each one.</li>
<li>If you are using a result in a prior paper the user should be able to read that paper. For that reason I try to give the websites of where the paper is. (this might be less crucial now then it used to be since if a paper is on lnie someplace for free its usually easy to find). Some students ask me if its okay to cite papers on arXiv. Of course it is, especially if it's to guide the reader to a place to read the result. Note also that papers on arXiv are not behind paywalls.</li>
<li>At some point a result is so well known that it does not need a citation. It's not clear when this is. I think people write `by the Cook-Levin theorem' without citing the original source. Nor do people ever cite Ramsey's original paper either. See next item for why this might be a mistake.</li>
<li>A reader might want to know WHEN a result was discovered. For this reason, perhaps people should give references for Cook-Levin or for Ramsey. The original source is often NOT a good place to read a result so I often do ``by a theorem of Curly [1] (see also Moe's simplification [2] or Larry's survey [3])'' so I give the reader WHO did it first, when they did it, but also an alternative place to read it. However, when does it end? `By the Pythagorean theorem [1] (also see [2])'</li>
<li>A reader should know the context of the result. Is the problem new? Is the problem related to other problems? Has there been much work in this field? Inquiring minds want to know!</li>
</ol>
https://blog.computationalcomplexity.org/2018/03/why-do-we-give-citations-how-should-we.htmlnoreply@blogger.com (GASARCH)4tag:blogger.com,1999:blog-3722233.post-3791320685237445183Wed, 14 Mar 2018 13:08:00 +00002018-03-14T09:08:17.836-04:00Stephen Hawking (1942-2018)<div class="separator" style="clear: both; text-align: center;">
<a href="https://upload.wikimedia.org/wikipedia/commons/e/eb/Stephen_Hawking.StarChild.jpg" imageanchor="1" style="clear: left; float: left; margin-bottom: 1em; margin-right: 1em;"><img border="0" data-original-height="359" data-original-width="250" height="200" src="https://upload.wikimedia.org/wikipedia/commons/e/eb/Stephen_Hawking.StarChild.jpg" width="137" /></a></div>
<div style="text-align: left;">
Stephen Hawking <a href="https://www.nytimes.com/2018/03/14/obituaries/stephen-hawking-dead.html">passed away</a> earlier this morning in Cambridge, England. As a brilliant theoretical physicist and best-selling author all while dealing with a debilitating disease, Hawking rose to be the best-known scientist of his time. </div>
<div style="text-align: left;">
<br /></div>
<div style="text-align: left;">
I'll leave it to the physics blogs to talk about his research. Hawking inspired me through his 1988 book, <a href="http://amzn.to/2Gqavr8"><i>A Brief History of Time</i></a>. Hawking told Time magazine before the magazine's publication "Someone told me that each equation I included in the book would halve the sales. In the end, however, I did put in Einstein’s famous equation E = mc<sup>2</sup>. I hope that this will not scare off half my potential readers.”<br />
<br />
So you read the book and he manages to describe his highly mathematical-based view of the universe without resorting to mathematics, by far the best written popular science book I have read.<br />
<br />
<i>A Brief History of Time</i> came out when I was in grad school so it didn't play a role in me becoming an academic but it did make me realize that science has a story to tell. From the preface of my own book.<br />
<blockquote class="tr_bq">
I took inspiration from Stephen Hawking's A Brief History of Time, which explains physics not through formulas and technicalities but with examples and stories. I attempt to do the same here to explore the spirit and importance of the P versus NP problem.</blockquote>
I am under no illusion that I came even close to Hawking's level of exposition.<br />
<br />
A <a href="https://www.researchamerica.org/sites/default/files/Americans'%20Attitudes%20about%20Science%20and%20Scientists%20in%202017.pdf">poll</a> taken last year showed most Americans could not name a single living scientist but among the 19% that could, the scientist they named most often was Stephen Hawking. We lost not only a brilliant physicist but one of the great symbols for science of our generation.</div>
https://blog.computationalcomplexity.org/2018/03/stephen-hawking-1942-2018.htmlnoreply@blogger.com (Lance Fortnow)1tag:blogger.com,1999:blog-3722233.post-1029435025512674786Mon, 12 Mar 2018 21:59:00 +00002018-03-12T17:59:00.341-04:00Wanted: An Easy Proof of a Weak Theorem in NT so that I can get another VDW--> Primes infinite proof to be really easy.(All math in this article is <a href="https://www.cs.umd.edu/users/gasarch/BLOGPAPERS/primesinfvdw2.pdf">here</a>)<br />
<div>
<br /></div>
<div>
A while back I posted about a proof that Van Der Waerden's theorem implies the number of primes</div>
<div>
is infinite (see the post <a href="https://blog.computationalcomplexity.org/2017/11/van-der-waerdens-theorem-implies.html">here</a>). That post brought up some logical issues.</div>
<div>
<br /></div>
<div>
More recently there is another proof that the primes are infinite that raises (for me at least) some number theory results and proofs. The proof uses the following theorem:</div>
<div>
<br /></div>
<div>
<i>There are no 4-length Arithmetic Progressions consisting of squares.</i></div>
<div>
<i><br /></i></div>
<div>
This is attributed to Fermat. All of the proofs I've seen of it look difficult.</div>
<div>
<br /></div>
<div>
Here is a sketch of the proof of infinite number of primes from VDW and the theorem above.</div>
<div>
Assume that {p1,...,pm} are all of the primes. Let vi(n) be the power of pi in the factorization of n.</div>
<div>
<br /></div>
<div>
We define the following 2<sup>m</sup> coloring of N</div>
<div>
<br /></div>
<div>
COL(n) = ( v1(n) mod 2, ... vm(n) mod 2)</div>
<div>
<br /></div>
<div>
There exists a monochromatic 4-AP. We leave it to the reader to show that you can use this to get a 4-AP of squares.</div>
<div>
<br /></div>
<div>
Using Fermats 4-AP theorem is hard! In the write up I show how to use a stronger VDW theorem and a weaker (at least easier to prove in my opinion) result in Number Theory to get a different proof.<br />
<br />
VDWPlus: for all k,c there exists W such that for all c-colorings of [W] there exists a,d such that<br />
<br />
a, a+d, a+2d, ..., a+(k-1)d AND d (that's the PLUS part) are all the same color.<br />
<br />
Now to prove primes are infinite. Assume not. p1,...,pm are all of the primes.<br />
<br />
Let vi(n) be as above<br />
<br />
COL(n) = (v1(n) mod 4, ..., vm(n) mod 4)<br />
<br />
just apply this to the k=1 case so we have<br />
<br />
a, a+d, d all the same color. Say the color is (b1,...,bm) where bi in {0,1,2,3}<br />
<br />
mult all three by p1^{4-b1} ... pm^{4-bm}.<br />
<br />
now we have A, A+D, D all four powers. call them x^4, z^4, y^4 and you<br />
contradict the n=4 case of Fermat'ls last theorem (this is the easiest case and was proven by Fermat)<br />
<br />
TO DO: find an even easier theorem in Number Theory to use with a perhaps more advanced form of VDW theorem to get a proof that primes are infinite.<br />
<br />
Coda: Cute that I replace one theorem by Fermat with another theorem by Fermat.</div>
https://blog.computationalcomplexity.org/2018/03/wanted-easy-proof-of-weak-theorem-in-nt.htmlnoreply@blogger.com (GASARCH)0tag:blogger.com,1999:blog-3722233.post-1938579207856937343Fri, 09 Mar 2018 13:37:00 +00002018-03-09T08:37:54.172-05:00Data-Driven ProgrammingFive years ago I posted about <a href="http://blog.computationalcomplexity.org/2012/12/flash-fill.html">Flash Fill</a>, a then new Microsoft Excel feature that would reformat data based on examples. I just checked the latest version of Excel and Flash Fill is still there just working by making suggestions when appropriate. It uses a programming language approach finding the simplest string manipulation program consistent with the examples.<br />
<br />
I loved the idea of example-based programming but it did seem pretty limited at the time. With the machine learning revolution we've gone full circle. We solve a number of problems with data and examples alone: voice recognition, face recognition, spam detection, playing Chess and Go from scratch in ways we wouldn't even know how to program.<br />
<br />
That's not completely true: Designing a good machine learning program requires programming to get data in a good format and creating the right network structure to learn is still considerably an art. But the real magic does happen when the deep learning process happens creating a neural net that works well in ways we can't fully understand even when we look at the final network produced.<br />
<br />
Now "it's all about the data". This hit me when I got an email invitation for the <a href="https://www.uber.com/c/uber-credit-card/">Uber visa card</a>. Unlike other branded cards it gives you no particular discounts or rewards for Uber. Rather it gives you significant cash back for dining and travel, in other words for giving Uber the data about you that can make Uber itself more valuable to you.<br />
<br />
Nothing in this post should be new to you readers. But every now and then just take a breadth and realize who much our notions of computing and data have changed over even the past five years.<br />
<br />
Programmers aren't going away. Machine learning works well for things humans do well instinctively. But for actual number crunching, simulations and manipulation, even what Flash Fill does, machine learning has much more to do.https://blog.computationalcomplexity.org/2018/03/data-driven-programming.htmlnoreply@blogger.com (Lance Fortnow)0tag:blogger.com,1999:blog-3722233.post-2782715569399365307Wed, 07 Mar 2018 15:43:00 +00002018-03-07T10:43:39.331-05:00When the Wrong People raise the issueOn my discrete math final in Spring 2017 I had a question:<br />
<br />
Prove that sqrt(2/3) is irrational.<br />
<br />
A student emailed me the folloing (I paraphrase and am prob not as elegant or as long as he was)<br />
<br />
Dr. Gasarch<br />
<br />
I received only 2 points out of 20 on Problem 3 of the final- the one that asked us to prove that sqrt(2/3) is irrational. This was graded rather harshly, and the reason is endemic to the entire course. It was unclear what we could and could not assume in this problem. That has been unclear all semester.<br />
<br />
I responded (I leave out the name for privacy)<br />
<br />
Mr. Student<br />
<br />
Come by my office and we will look over your final. At the same time, bring by your HWs and Midterms to look at. The deadline for regrading those is up; however, either you are correct and I will learn how to run a better course by looking over your HWs and midterms, or you incorrect and you will be enlightened by us looking over them.<br />
<br />
We agreed to meet. The Student came all ready to argue not just points on the final but also about the course in general. I looked forward to this since either I would learn about how to run the course better OR I would enlighten a student!<br />
<br />
STUDENT: I used the obvious fact that the ratio of two irrationals is irrational. How was I supposed to know I had to prove something so obvious!!!!!!!! And only 2 points!!!!!!! Really!!!!!!<br />
<br />
BILL: What is the ratio of \sqrt{8} to \sqrt{2}.<br />
<br />
STUDENT: sqrt(8)/sqrt(2) = sqrt(8/2) = sqrt(4) = 2. Why is that relevant?<br />
<br />
BILL: You just showed that the ratio of two irrationals could be rational.<br />
<br />
STUDENT: Oh.<br />
<br />
BILL: Lets look over your HW and midterm and see there were times when it was not clear what you could assume OR if not then I can clear up some misconception you had.<br />
<br />
STUDENT: Uh, Uh. Nevermind.<br />
<br />
BILL: You are here with your HWs and midterms, lets take a look.<br />
<br />
He really didn't want to. I think he really just wanted more points on the final But since he phrased it as a philosphical debate about how the course was run, I took him at his word. Everything he showed me was either clearly wrong or clearly unclear. None of it fell into the category of `not clear what you can assume'.<br />
<br />
This disappointed me. I suspect someone could make a case that my course sometimes does not make it clear what you can assume. Other students with a similar story as above claim my course is to pedantic. But the examples they show me of this are usually just wrong, not marked wrong for being to pedantic.<br />
<br />
There is a more general problem here. The students who complain about a course <i>may well have a valid point to make! </i>But its usually students who are not very good making the complaint, and hence they are not the ones who could make a good argument. One thing I have done when a student has a complaint about how I run the course is then ask my TAs about it. This has been helpful sometimes but they are on the other end -- the course is easy for them so its hard for them to see the problems.<br />
<br />
Having said all of this I will own up to one flaw I've had which the students complained about incoherently (see <a href="http://blog.computationalcomplexity.org/2017/05/students-try-to-memorize-rather-than.html">here</a>) and my TA pointed out the fair objection. I had taught ONE type of Pigeon hold argument and tested them on a very closely related but different type -- as a way of testing if they understood pigeon hole and were not just memorizing. It was a fair question BUT my TA said<br />
(correctly) I was more interested in getting a good test question then, you know, TEACHING them the Pigeon hole principle -- so I should in the future (and I have) teach them LOTS of versions, make sure they understand them, and then if on the exam I give them a variant its more fair. But more importantly he pointed out that I (and this is correct, or was) have a QUESTION I really want to put on the midterm and then teach the course so that it makes sense to do so. The question is fair, but this is NOT the point (which is why the students objections were incoherent- the question was fair). I am setting (some of them) up to fail. I have CHANGED my Teaching style and exam style since them.<br />
<br />But my point is that the students could not possibly have raised that objection-- partly because the students complaining are not very good, but also because they do not see what goes on behind the scenes.<br />
<br />
UPSHOT- if your students have an incoherent complaint there may be something to it and you should ask your TAs.<br />
<br />
<br />https://blog.computationalcomplexity.org/2018/03/when-wrong-people-raise-issue.htmlnoreply@blogger.com (GASARCH)0tag:blogger.com,1999:blog-3722233.post-1717950974413246529Thu, 01 Mar 2018 12:33:00 +00002018-03-01T07:33:03.491-05:00Me and My Bolt<div class="separator" style="clear: both; text-align: center;">
<a href="https://1.bp.blogspot.com/-HF3agKD1Xco/WpXJ9aJxf2I/AAAAAAABfTc/wvZPMCv0b6UJ7iqhF7jtzrqHLGFzyjlnwCKgBGAs/s1600/IMG_20171215_134715.jpg" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" data-original-height="1200" data-original-width="1600" height="240" src="https://1.bp.blogspot.com/-HF3agKD1Xco/WpXJ9aJxf2I/AAAAAAABfTc/wvZPMCv0b6UJ7iqhF7jtzrqHLGFzyjlnwCKgBGAs/s320/IMG_20171215_134715.jpg" width="320" /></a></div>
<div class="separator" style="clear: both; text-align: center;">
<br /></div>
<div class="separator" style="clear: both; text-align: left;">
On Tuesday I got a knock on my car's window. Rolling it down someone asked if I liked my car as he was thinking of buying one himself. Was I driving the latest Tesla? No, the Chevy Bolt, General Motor's newest fully electric car.</div>
<div class="separator" style="clear: both; text-align: left;">
<br /></div>
<div class="separator" style="clear: both; text-align: left;">
On March 31, 2016 me and 180,000 of my closest friends put $1000 down sight unseen on the Tesla 3. As an east coast resident with no prior Tesla I am well down the list even though I made a reservation on the first day. I got disillusioned by early production problems and delays and bait-and-switch emails.</div>
<blockquote class="tr_bq" style="clear: both; text-align: left;">
Now that some more details regarding Model 3 came out, I wanted to gauge your interest in coming in for a test drive in a Model S. An incredibly well equipped Model S can be had for under $80k and with the $7500 federal tax credit and $1000 referral code from a current owner, you can get into a Model S for close to $70k, meanwhile a Model 3 can cost up to $60k. Model S is considerably quicker and has an incredible amount of space to seat 5 comfortably. It is our flagship vehicle and has 5 years of manufacturing behind it to perfect the build quality of the car. Not to mention a quick turnaround time on delivery. I would love to host you in our showroom so I can showcase some of the incredible features in the Model S.</blockquote>
Meanwhile a GM executive on the Georgia Tech College of Computing's advisory board suggested I take a look at the Bolt. I was skeptical but he arranged for a local dealer to bring down a car to test drive. I got sold and bought my own Bolt in December.<br />
<br />
It's an all electric car with no transmission so quick smooth acceleration. The Bolt has a one pedal driving mode as the "gas" pedal also works as a break which slows down the car by pulling power to the battery. The car doesn't even pretend to be mechanical, a screen boots up when I turn the car on, you can shift into park by pressing a button. The rear view "mirror" is really a camera. When driving slowly there is a simulated view from above. A little freaky but it helps with parking. With Android Auto I basically have Google Assistant and Maps in the car which I prefer to an in-car navigation the Bolt doesn't have.<br />
<br />
I get over 200 miles on a full charge and can plug in overnight to get enough power to get to work and back. The car has considerable safety features that warn about cars in blind sports or getting too close to the car in front of you or if you drift from lanes. The Bolt lacks any autonomous features even adaptive cruise control or parking assist. I suspect you could get significant autonomous behavior with a software upgrade but I doubt GM would ever do so.<br />
<br />
The car is missing some basic features like power seats and a garage door button. No problem, I rigged up Google Assistant to open the garage door when I say the magic words. Far cooler than pressing a button.<br />
<br />
It's not as sleek looking as a Tesla and nobody will shoot it into space but I'm driving the future and it is amazing.https://blog.computationalcomplexity.org/2018/03/me-and-my-bolt.htmlnoreply@blogger.com (Lance Fortnow)6tag:blogger.com,1999:blog-3722233.post-3863982816377095778Sun, 25 Feb 2018 21:56:00 +00002018-02-26T00:11:41.862-05:00When students are wrong but have a valid point, encourage themI often have the class VOTE on a statement (the choices are usually TRUE/FALSE/UNKNOWN TO SCIENCE/Stewart-Colbert-2020)<br />
<br />
I ask the students who voted incorrectly (some say anything except Stewart-Colbert-2020 is an incorrect vote, though I'm partial to Bee-Oliver, though John Oliver was not born in this country so he's not eligible, though our current president might say that neither was Obama so thats not a bar to the presidency) why they vote the way they do to get a good discussion going. I give some examples. I use real first names but decided to not give last names for reasons of security. The people involved all agreed. If you have examples of students being WRONG but HAVING A POINT, leave an intelligent comment about it!<br />
<br />
1) In Discrete Math they vote on: <i>is Q, the rationals, countable?</i>One of the NO votes was named Alice (really!).<br />
<br />
<i><b>Alice</b>: The rationals, like there are SO many of them. They are just so crammed in their. I mean really!</i><br />
<i><br /></i>
<i><b>Bill</b>: I think you want to say that between any two rationals is a rational.</i><br />
<i><br /></i>
<i><b>Alice: </b>Thats what I said!!</i><br />
<i><br /></i>
<i><b>Bill:</b> Great! And realize that a set is countable if there is a bijection from the set to N. So what you are really saying is-----</i><br />
<i><br /></i>
<b style="font-style: italic;">Alice: </b><span style="font-style: italic;">There is a bijection between N and Q but not an order preserving Bijection!</span><br />
<span style="font-style: italic;"><br /></span>
2) In Formal Lang theory they vote <i>if alpha is a reg expression and L(alpha) is the lang generated by alpha then is there a reg exp beta such that L(beta) is the complement of L(alpha). </i>One of the NO votes was named Andrea (nickname Andy).<br />
<br />
<b><i>Andy:</i> </b><i>Given alpha I just don't see an easy way, or for that matter any way, to create beta.</i><br />
<i><br /></i>
<i><b>Bill:</b> I will soon prove that regular expressions are equivalent to DFA's. So what one would do is take the L(alpha), form the DFA, complement the DFA, then convert back to a regular expression.</i><br />
<i><br /></i>
<i><b>Andy: </b>Oh, yes that works, but it seems complicated.</i><br />
<i><br /></i>
<b style="font-style: italic;">Bill: </b><span style="font-style: italic;">It is! You though it would be complicated so it was false. Even though its true, your intuition that its complicated is correct! In fact, there are reg expressions of length n such that the complement lang has a rather large reg expression.</span><br />
<span style="font-style: italic;"><br /></span>
<span style="font-style: italic;">3) </span>Formal Lang theory again. Not a vote this time. I had on the board the regular expression<br />
<br />
(a UNION b)(a UNION b )^*<br />
<br />
A student Dolapo thought it could be simplified:<br />
<br />
<i><b>Dolapo: </b>Can't you write that as the regular expression (a union b)^+ ?</i><br />
<i><br /></i>
<b style="font-style: italic;">Bill: </b><span style="font-style: italic;">Yes and no. Yes the lang is (a UNION b)^+, but + is not allowed in regular expressions.</span><br />
<span style="font-style: italic;"><br /></span>
<span style="font-style: italic;"><b>Dolapo</b>: Why not?</span><br />
<span style="font-style: italic;"><br /></span>
<span style="font-style: italic;"><b>Bill: </b>First off, they really could have been defined that way and perhaps should have. So why weren't they? I go with historical accident, but some people disagree- see my blog post <a href="http://blog.computationalcomplexity.org/2017/03/why-are-regular-expressions-defined-way.html">here</a></span>https://blog.computationalcomplexity.org/2018/02/when-students-are-wrong-but-have-valid.htmlnoreply@blogger.com (GASARCH)5tag:blogger.com,1999:blog-3722233.post-8116578564622534031Thu, 22 Feb 2018 12:43:00 +00002018-02-22T07:43:46.336-05:00NP is HardYou don't get much press by stating conventional beliefs--there is no "round earth society". Nevertheless there are serious researchers out there trying to say that it is reasonably possible if not likely that P = NP. Don't believe it.<br />
<div>
<br /></div>
<div>
Emanuele Viola just outright states <a href="https://emanueleviola.wordpress.com/2018/02/16/i-believe-pnp/">I Believe P = NP</a>. He starts with a similar argument that we've seen from <a href="https://rjlipton.wordpress.com/conventional-wisdom-and-pnp/">Richard Lipton</a>: We've had surprising results in the past so why should the convention wisdom that P ≠ NP be true? I have two major problems with this line of reasoning:</div>
<div>
<ul>
<li>These arguments cherry pick certain results and ignore the vast majority of theorems that went the way we expected. It's akin to saying that because there have been lottery winners in the past, the ticket I hold in my hand is likely to be a winner.</li>
<li>All the major surprises in complexity have occurred early in first two decades of the P v NP era. We've seen no surprises at that level since the early 90's. We have seen surprise proofs of results like Primes in P, Undirected Connectivity in Log Space and NEXP not in ACC<sup>0</sup> but the theorems themselves surprised no one. </li>
</ul>
<div>
Viola also makes the argument that we've seen fewer significant lower bound results than upper bounds. This doesn't surprise me--an upper bound requires a single algorithm, a lower bound requires showing an infinite number of algorithms can't work. I fully agree that we're unlikely to see a proof that P ≠ NP in the near future. But this isn't a reason to think they are the same. And we've seen no non-trivial algorithms for general NP problems like circuit-SAT.</div>
<div>
<br /></div>
<div>
Which takes me to Ryan Williams <a href="http://people.csail.mit.edu/rrw/likelihoods.pdf">Some Estimated Likelihoods For Computational Complexity</a> where he gives 20% probability (which I consider nearly 20% too high) that P = NP based on similar logic. Ryan surprises me even more by giving a whopping 80% chance that NEXP = coNEXP. That would imply every easily describable tautology has a short proof of being a tautology (for the appropriate definitions of describable and short) which I find hard to fathom.</div>
</div>
<div>
<br /></div>
<div>
If I would guess collapses that might happen, I would suggest L = NL (directed connectivity in log space) or one that Ryan gives even odds, TC<sup>0</sup> = NC<sup>1</sup>. TC<sup>0</sup> captures constant-depth neural networks and as we've seen from the ML community, those neural nets look awfully powerful. </div>
https://blog.computationalcomplexity.org/2018/02/np-is-hard.htmlnoreply@blogger.com (Lance Fortnow)17tag:blogger.com,1999:blog-3722233.post-3843782443995752343Mon, 19 Feb 2018 04:08:00 +00002018-02-18T23:08:44.223-05:00The web bad/People using it bad.I was going to write a post about how hard it was to find what grades mean at different schools (e.g., at UMCP W (for withdraw) means the student dropped the course, but at UT Austin its Q (for Quit?)) but then I found that my Googling<br />
<br />
Name of school grade key<br />
<br />
I could find it. Okay, so grade keys are not that hard to find.<br />
<br />
WEB BAD:<br />
<br />
However, course descriptions are. Both questions (what grades mean and course desc) came up when I do admissions for my REU program. If a student has a course in<i> Discrete Mathematics</i> that could mean a course where you learn how to prove simple things OR it could mean a course where you proof the graph minor theorem (actually I doubt that) or something in between. Similar for <i>Principles of Programming languages</i> and <i>Software Engineering </i>in that they could mean a variety of things. I think math and physics are more standardized, but even there you have the problem that <i>Advanced calc </i>could be either multivar or a course with proofs or something else. There is a great related XKCD <a href="https://xkcd.com/773/">here</a>.<br />
<br />
PEOPLE USING THE WEB BADLY:<br />
<br />
Fellow blogger Scott Aaronson recently posted about Vivek Wadhwa's Washington post column on quantum computing (the post is <a href="https://www.scottaaronson.com/blog/?p=3645">here</a>) The article by Vivek told the tired and utterly false story that QC can be used to solve TSP by looking at all possibilities. Should Vivik have known better by looking at the web? At first I thought YES he should know better. But then I thought -- I should try to see what he might have done. Maybe the web has this one wrong. In fact, some of my students Iwho, I should add, are not writing articles on QC for the Washington Post) tell me that they don't need to learn the proof of the Cook-Levin theorem since Quantum Computers can solve SAT anyway. So I decided to pretend I didn't know anything about QC and went to the web to see what I could find. First stop: Wikipedia. I found the following quote in the QC article:<br />
<i><br /></i>
<i>BQP is suspected to be disjoint from NP-complete and a strict superset of P though this is not known.</i><br />
<br />
So, the first place I look I find that BQP is suspected to NOT solve SAT or TSP or... Realize that Wikipedia is not some obscure source of hidden knowledge. It is literally the first place one would look. Hence, no excuse, even if other experts told him otherwise (which seems to be the case, though `experts' should be in quotes) the Wikipedia quote should at least give pause.<br />
<br />
So even when Wikipedia gives the right information, not everyone looks there.<br />
<br />
<br />https://blog.computationalcomplexity.org/2018/02/the-web-badpeople-using-it-bad.htmlnoreply@blogger.com (GASARCH)5tag:blogger.com,1999:blog-3722233.post-8202444280934257678Thu, 15 Feb 2018 13:09:00 +00002018-02-15T08:09:36.775-05:00Corporate EducationFirst of all read the <a href="http://blog.geomblog.org/2018/02/a-metoo-testimonial-that-hits-close-to.html">#metoo testimonial</a> going around the TCS blogosphere. Our field is not immune.<br />
<br />
Last Sunday Frank Bruni wrote an op-ed column <a href="https://www.nytimes.com/2018/02/10/opinion/sunday/corporations-will-inherit-the-earth.html">Corporations will Inherit the Earth</a>, an article on how corporations have taken on what governments used to do. Quite a bit is focused on education.<br />
<blockquote class="tr_bq">
The nimbleness of corporations gives them an edge over hoary, complacent institutions, including those in higher education...In an effort to make sure that employees have up-to-the-minute technical skills--or are simply adept at critical thinking and creative problem solving -- more companies have developed academies of their own. That's likely to accelerate. "I think enterprises like Amazon and Google are going to build universities that teach coding and things the nation needs" said Margaret Spellings, former education secretary and current president of the University of North Carolina system.</blockquote>
Already in the universities we've seen a move towards more majors and minors in STEM and computer science in particular. The changing corporate workplace has already changed academia, putting more an emphasis on technical areas and less on the liberal arts. Will companies though take the next step, running their own schools that focus on the needs of industry? If we see continued decreased government funding for universities and academic research, we may end up with a handful of rich universities and the rest of the population getting education on the job, a future that would be a loss for us all.<br />
<br />
<br />https://blog.computationalcomplexity.org/2018/02/corporate-education.htmlnoreply@blogger.com (Lance Fortnow)4tag:blogger.com,1999:blog-3722233.post-6728758538049236376Sat, 10 Feb 2018 15:10:00 +00002018-02-10T10:14:29.623-05:00A ``new'' ``application'' of Ramsey Theory/A Truly ``bad'' math songIan Parberry once told me (though I doubt he originated it- The first link I found says it was Mark Twain)<br />
<br />
<br />
<i>to a man with a hammer, everything looks like a nail</i><br />
<i><br /></i>
Indeed. Since I am teaching a grad course <i>Ramsey theory and its ``Applications'' </i>(I got 24 students, which is more than I thought I would- including around 10 ugrads who are taking it because `all the cool kids are taking it' ) I have been taking the hammer of Ramsey Theory and looking for nails to apply it to. (I'm also using a webiste I found of applications of Ramsey Theory <a href="https://www.cs.umd.edu/users/gasarch/TOPICS/ramsey/ramsey.html">here</a> and an survey article on applications of Ramsey <a href="http://www.combinatorics.org/ojs/index.php/eljc/article/view/DS13/pdf">here</a>.)<br />
<br />
Thinking about the infinite Ramsey Theorem I came up with this ``application'' :<br />
<br />
I<i>f p1, p2, p3, ... is an infinite sequence of points in R<sup>n</sup> then there exists a subsequence q1, q2,q3,... such that for each coordinate 1 ≤ i ≤ n the projection onto that coordinate is either (a) strictly incresing, (b) strictly decreasing, or (c) constant.</i><br />
<br />
<b>Proof: </b>For i< j color (i,j) with one of 3^n colors - indicating for each coordinate i if the ith projection is increaing, decreasing, or constant. The infinite homog set gives you the sequence.<br />
<br />
<b>End of Proof</b><br />
<b><br /></b>
One can also proof this from the Bolzano-Weierstrass theorem (an infinite bounded sequence of points in R<sup>n</sup> has a convergent subsequence). We leave that proof to the reader; however, the proof of BW looks like the proof of the infinite Ramsey Theorem, so I'm not sure if my proof is new or not.<br />
<br />
I wanted to look into the BW theorem so I googled "Bolzano-Weierstrass" I think Google knows me better than I know myself since the second hit was <a href="https://www.youtube.com/watch?v=dfO18klwKHg">https://www.youtube.com/watch?v=dfO18klwKHg</a> which is a Rap Song about the BW theorem (I am a fan of novelty songs, and of math, so does it follow I am a fan of Math Novelty songs. Not sure if its follows, but I AM!)<br />
<br />
One of the problems on the HW was <i>BW-rap- good, bad, or really bad?</i><br />
<i><br /></i>
Answers were:<br />
<br />
1) Made my ears bleed<br />
<br />
2) Lyrics good, singing really bad<br />
<br />
3) So bad its good<br />
<br />
4) No, just bad.<br />
<br />
I'm in the <i>Lyrics good/singing is `so bad its good'</i> camp. The class was okay with the lyrics, but mostly thought it was <i>so bad its... bad.</i> One person thought it was awesome!<br />
<br />
I would like to see real rapper perform it on you tube. I doubt I will. Oh well.https://blog.computationalcomplexity.org/2018/02/a-new-application-of-ramsey-theorya.htmlnoreply@blogger.com (GASARCH)2tag:blogger.com,1999:blog-3722233.post-5853037051528031641Thu, 08 Feb 2018 12:42:00 +00002018-02-08T07:42:35.056-05:00For the Love of AlgorithmsWired magazine labelled 2017 as <a href="https://www.wired.com/story/2017-was-the-year-we-fell-out-of-love-with-algorithms/">The Year We Fell Out of Love with Algorithms</a>. The article goes on to talk about how algorithms give us filter bubbles, affect elections, propagate biases and eliminate privacy. The article at the end argues that we shouldn't blame the algorithm but the people and companies behind them.<br />
<br />
Every day algorithms decide what music we listen to, what posts we see on Facebook and Twitter, how we should drive from point A to point B, what products we should buy. Algorithms feed my nostalgia in Facebook and Google Photos showing me what once was. Algorithms recognize my voice and my face. We've even created new currencies from algorithms. Algorithms form the backbone of the top six world's largest public companies (Apple, Alphabet, Microsoft, Amazon, Facebook and Tencent). It's been a long time since I only trusted algorithms to format my papers.<br />
<br />
Algorithms have taken over nearly every aspect of our lives and our economy. With new machine learning techniques, no longer can the creator of an algorithm fully understand how algorithms work. But we aren't in a Skynet world, algorithms are not sentient and not even inherently bad, any more than we label a group of people inherently bad because of a few examples.<br />
<br />
This societal transition from human-oriented decision to algorithmic decision making will continue and will have great benefits such as much safer cars and medical care. We must be vigilant, of course, to how algorithms will change society, but (in a serious sense) I welcome our new machine overlords.https://blog.computationalcomplexity.org/2018/02/for-love-of-algorithms.htmlnoreply@blogger.com (Lance Fortnow)7tag:blogger.com,1999:blog-3722233.post-478483437611165922Tue, 06 Feb 2018 03:30:00 +00002018-02-05T22:30:03.053-05:00"How can you use your research for ugrad projects?'- the wrong questionI was helping a math PhD who worked in computable ramsey theory prepare his teaching and research statements for his job application. One of the questions various schools wanted to know was<br />
<br />
<i>How can you use your research as the basis for undergraduate projects?</i><br />
<i><br /></i>
His answer was kind of a cheat- Ramsey Theory was combinatorics which ugrads can work on without too much prior knowledge (true), computability theory could be picked up (not true), and the chance to combine the two should thrill ugrads (it doesn't even thrill most Ramsey Theorists!).<br />
<br />
I don't fault the PhD student, I fault the school. What they really want to know is:<br />
<br />
<i>Can you come up with ugrad projects?</i><br />
<br />
They should realize that some math requires too much bacground and is not appropriate for ugrads AND that a math PhD will have picked up OTHER knowledge for projects. They may relate some to the research (e.g., in the case above just Ramsey Theory) or they may not even be close.<br />
<br />
In Comp Sci it is more common for an ugrad to work on research related to a profs research since Comp Sci is a younger field and needs less background knowledge. And students can often code something up of interest related to the profs research.<br />
<br />
SO- do you have ugrads work on your research program OR on something else?<br />
<br />
<br />
<br />
<br />https://blog.computationalcomplexity.org/2018/02/how-can-you-use-your-research-for-ugrad.htmlnoreply@blogger.com (GASARCH)2tag:blogger.com,1999:blog-3722233.post-6426941553330413155Thu, 01 Feb 2018 18:06:00 +00002018-02-01T13:07:30.130-05:00Flying BlindMany computer science conferences have made a number of innovations such as a rebuttal phase, multi-tiered program committees, a hybrid journal/conference model with submission deadlines spread through the year. Not theoretical computer science which hasn't significantly changed their review process in the major conferences since allowing electronic submissions in the early 90's and an ever growing program committee <a href="http://www.diku.dk/~mthorup/FOCS18/FOCS18-cfp.htm">now at 30 for FOCS</a>.<br />
<br />
Suresh Venkatasubramanian learned this lesson when he ran a <a href="http://blog.geomblog.org/2018/01/report-on-double-blind-reviewing-in.html">double blind experiment for ALENEX</a> (Algorithmic Engineering and Experiments) and <a href="http://blog.geomblog.org/2018/01/double-blind-review-at-theory.html">laid out an argument</a> for double blind at broader theory conferences to limit the biases that go along with knowing the authors of a paper. The theory blogosphere responded with posts by <a href="http://mybiasedcoin.blogspot.com/2018/01/double-blind-alenex.html">Michael Mitzenmacher</a>, <a href="https://windowsontheory.org/2018/01/11/on-double-blind-reviews-in-theory-conferences/">Boaz Barak</a> and <a href="https://theorydish.blog/2018/01/25/just-defined-bias-not-sure/">Omer Reingold</a> and a response by <a href="http://blog.geomblog.org/2018/01/double-blind-review-continuing.html">Suresh</a>. I can't stay out of a good conference discussion so here goes.<br />
<br />
Today major orchestra auditions happen behind a screen with artists even told to remove footwear so sounds won't give away the gender of the musician. On the other extreme, the value of a piece of art can increase dramatically in price if it is discovered to be the work of a famous artist, even though it is the same piece of art. Where do research papers lie? It's more a work of art than a violinist in a symphony.<br />
<br />
Knowing the authors gives useful information, even beyond trusting them to have properly checked their proofs. Academics establish themselves as a brand in their research and you learn to trust that when certain people submit to a conference you know what you get, much the way you would more likely buy a new book from an author you love.<br />
<br />
Suresh rightly points out that having authors names can and do produce biases, often against women and researchers at lesser known universities. But we should educate the program committee members and trust that they can mitigate their biases. We can completely eliminate biases by choosing papers at random but nobody would expect that to produce a good program.<br />
<br />
Having said all that, we should experiment with double blind submissions. Because everything I said above could be wrong and we won't know unless we try.https://blog.computationalcomplexity.org/2018/02/flying-blind.htmlnoreply@blogger.com (Lance Fortnow)17tag:blogger.com,1999:blog-3722233.post-4853416171168759408Mon, 29 Jan 2018 13:58:00 +00002018-01-29T08:58:50.557-05:00Publishing: Why are we doing it right and other sciences aren't?(NOTE- this is NOT a `we hate Elsevier and the others' post- though I suspect the comments will be about that.)<br />
<br />
Alexandra Elbakyan has created a repository of science papers for scientists to share. She did this because too many papers were behind paywalls. An article about her (and the inspiration for this post) is <a href="https://www.thedailybeast.com/is-this-science-hacker-a-heroine-or-a-villain">here</a>. Note that she has had some legal problems.<br />
<br />
But it got me thinking: I have rarely had a problem getting an article. Between authors websites and arXiv most of what I want is out there. Lance and others I've asked agree--- while there are problems with editors and publishes etc, access is NOT one of them.<br />
<br />
Why don't other scientists just routinely do this?<br />
<br />
some speculation but if someone actually knows please comment<br />
<br />
1) Some scientists purposely don't post on line to avoid being scooped. Or the fear of that<br />
<br />
2) Some scientists don't post for fear of legal issues with publishing. I do not know of a single computer scientist or mathematician that has gotten in any kind of trouble for posting a paper on their website or arXiv.<br />
<br />
3) Some scientists are lazy.<br />
<br />
4) (This contrasts with Comp Sci) other fields do things the way they do since they ALWAYS did it that way. Comp Sci is a younger field and hence is less tied to tradition.<br />
<br />
5) Other scientists ARE posting their papers (gee, then why did Alexandra have to create the reporistory).<br />
<br />
6) Alexandar is where arxiv was X years ago. They'll catch up. But they are having legal problems-- did arXiv ever have legal problems?<br />
<br />
Looking over these I'm not sure I believe any of them. Any other ideas?<br />
<br />
Again, the question is: Why don't other fields routinely post to something like arXiv or their own websites?https://blog.computationalcomplexity.org/2018/01/publishing-why-are-we-doing-it-right.htmlnoreply@blogger.com (GASARCH)11tag:blogger.com,1999:blog-3722233.post-8481902663870246137Fri, 26 Jan 2018 14:18:00 +00002018-01-26T09:18:29.372-05:00From Art to ScienceQ: Why did the neural net cross the road?<br />
A: Who cares along as it got to the other side.<br />
<br />
Whit Diffie and Martin Hellman in their <a href="https://doi.org/10.1109/TIT.1976.1055638">classic 1976 paper</a> talk about the transition of cryptography:<br />
<blockquote class="tr_bq">
Theoretical developments in information theory and computer science show promise of providing provably secure cryptosystems, changing this ancient art into a science.</blockquote>
Indeed we have some very strong theoretical foundations for cryptography, though they still need to rely on unproven hardness assumptions. Often we trade off formal proven techniques for efficiency, in for example AES and Bitcoin. Here we use "science" in another sense: extensive testing of the hardness of these protocols. Creating and breaking cryptographic protocols used to be an art, having the right intuitions to make things work (for now). Today, breaking security rarely involves breaking a cryptographic protocol but rather due to bad implementations and easy-to-guess or phished passwords.<br />
<br />
For neural networks we still live in an art regime. We have great methods to minimize the error for a given network (though no formal proofs as such), one still needs to design the right network with the appropriate topology and various tricks like regularization to prevent overfitting. Several members of the theoretical CS community have taken on the task to turn the art into a science but getting us to where we sit in cryptography will take some time. Crytography took thousands of years to get from an art to science, hopefully we can get there faster for machine learning.<br />
<br />
This debate came to a head at the recent NIPS conference. Ali Rahimi in his <a href="https://www.youtube.com/watch?v=ORHFOnaEzPc">test-of-time talk</a> described the current state of ML research as "alchemy". Yann LeCun gave a <a href="https://www.facebook.com/yann.lecun/posts/10154938130592143">strong response</a><br />
<blockquote class="tr_bq">
Sticking to a set of methods just because you can do theory about it, while ignoring a set of methods that empirically work better just because you don't (yet) understand them theoretically is akin to looking for your lost car keys under the street light knowing you lost them someplace else.</blockquote>
Imagine if we never did any cryptography until we had the science in place.<br />
<br />
Proving theorems in mathematics is an art more than a science. Because of incompleteness in some sense it has to be. If mathematics ever became automated it would be a whole lot less fun.https://blog.computationalcomplexity.org/2018/01/from-art-to-science.htmlnoreply@blogger.com (Lance Fortnow)6