tag:blogger.com,1999:blog-37222332019-07-18T09:22:37.119-04:00Computational ComplexityComputational Complexity and other fun stuff in math and computer science from Lance Fortnow and Bill GasarchLance Fortnowhttp://www.blogger.com/profile/06752030912874378610noreply@blogger.comBlogger2701125tag:blogger.com,1999:blog-3722233.post-60696377598378349722019-07-16T19:38:00.000-04:002019-07-16T19:38:00.557-04:00Guest post by Samir Khuller on attending The TCS Women 2019 meeting<br />
(I will post the solution to the problem in the last blog later in the week---probably Thursday. Meanwhile, enjoy these thoughts from Samir Khuller on the TCS Women 2019 meeting.)<br />
<br />
Guest Post by Samir Khuller:<br />
<br />
Am I even allowed here?” was the first thought that crossed my mind when I entered the room. It was packed with women (over 95%), however a few minutes later, several men had trickled in. I was at the TCS Women spotlight workshop on the day before STOC. Kudos to Barna Saha, Sofya Raskhodnikova, and Virginia Vassilevska Williams for putting this grand (and long needed) event together, which serves as a role model and showcases some of the recent work by rising stars. In addition to the Sun afternoon workshop, the event was followed by both an all women panel and a poster session (which I sadly did not attend).<br />
<br />
<br />
The rising stars talks were given by Naama Ben-David (CMU), Andrea Lincoln (MIT), Debarati Das (Charles University) and Oxana Poburinnaya (Boston U). After a short break the inspirational talk was by Ronitt Rubinfeld from MIT. Ronitt’s talk was on the topic of Program Checking, but she made it inspirational by putting us in her shoes as a young graduate student, three decades back, trying to make a dent in research by working on something that her advisor Manuel Blum, and his senior graduate student Sampath Kannan had been working on, and I must say she made a pretty big dent in the process! She also related those ideas to other pieces of work done since in a really elegant manner and how these pieces of work lead to work on property testing.<br />
<br />
<br />
I am delighted to say that NSF supported the workshop along with companies such as Amazon, Akamai, Google and Microsoft. SIGACT plans to be a major sponsor next year.<br />
<br />
<br />
The Full program for the workshop is at the following URL<a href="https://sigact.org/tcswomen/tcs-women-2019/">here.</a><br />
<br />
GASARCHhttp://www.blogger.com/profile/03615736448441925334noreply@blogger.com1tag:blogger.com,1999:blog-3722233.post-42548687584356651142019-07-14T23:12:00.000-04:002019-07-14T23:12:25.307-04:00Two infinite hat problem and a question about what is ``well known''<br />
This is a joint post with David Marcus. You will see how he is involved in my next post.<br />
<br />
Two infinite hat problems based on one scenario. I am also curious if they are well known.<br />
<br />
1) There are an infinite number of people, numbered 1,2,3,... There are 2 colors of hats. They can all see everyone's hat but their own. <br />
<br />
2) The adversary is going to put hats on all the people. They will guess their own hat color<i> at the same time</i>. <br />
<br />
3) The people can discuss strategy ahead of time, but must use a deterministic strategy and the adversary knows the strategy.<br />
<br />
4) The people want to minimize how many they get wrong. <br />
<br />
5) The adversary puts on hats to maximize how many they get wrong.<br />
<br />
I ask two questions and one meta-question:<br />
<br />
Q1: Is there a solution where they get all but a finite number of the guesses right? (I have blogged about a variant of this one a while back.)<br />
<br />
Q2: Is there a solution where they get all but at most (say) 18 wrong. (My students would say <i>the answer has to be YES or he</i> <i>wouldn't ask it</i>. They don't realize that I work on upper AND lower bounds!)<br />
<br />
Q3: How well known is problem Q1 and the solution? Q2 and the solution? I've seen Q1 and its solution around (not sure where), but the only source on Q2 that I know of is CAN'T TELL YOU IN THIS POST, WILL IN THE NEXT POST. So, please leave a comment telling me if you have seen Q1 or Q2 and solutions. And if so then where.<br />
<br />
Feel free to leave any comments you want; however, I warn readers who want to solve it themselves to not look at the comments, or at my next post.<br />
GASARCHhttp://www.blogger.com/profile/03615736448441925334noreply@blogger.com10tag:blogger.com,1999:blog-3722233.post-17056251913988218232019-07-11T13:54:00.000-04:002019-07-11T15:37:18.780-04:00Degree and SensitivityHao Huang's <a href="https://arxiv.org/abs/1907.00847">proof of the sensitivity conjecture</a> that I <a href="https://blog.computationalcomplexity.org/2019/07/local-kid-makes-history.html">posted on last week</a> relied on a 1992 <a href="https://doi.org/10.1016/0097-3165(92)90060-8">result of Gotsman and Linial</a>. Let's talk about that result.<br />
<br />
Consider the set S={-1,1}<sup>n</sup>. The hypercube of dimension n is the graph with vertex set S and an edge between x = (x<sub>1</sub>,…,x<sub>n</sub>) and y = (y<sub>1</sub>,…,y<sub>n</sub>) in S if there is exactly one i such that x<sub>i</sub> ≠ y<sub>i</sub>. Every vertex has degree n.<br />
<br />
We say a vertex x is odd if x has an odd number of -1 coordinates, even otherwise. Every edge joins an odd and even vertex.<br />
<br />
Let f be a function mapping S to {-1,1}. The sensitivity of f on x is the number of i such that f(x<sub>1</sub>,…,x<sub>i</sub>,…,x<sub>n</sub>) ≠ f(x<sub>1</sub>,…,-x<sub>i</sub>,…,x<sub>n</sub>). The sensitivity of f is the maximum over all x in S of the sensitivity of f on x.<br />
<br />
Let g be the same function as f except that we flip the value on all odd vertices. Notice now that the sensitivity of f on x is the number of i such that g(x<sub>1</sub>,…,x<sub>i</sub>,…,x<sub>n</sub>) = g(x<sub>1</sub>,…,-x<sub>i</sub>,…,x<sub>n</sub>).<br />
<br />
Let G be the induced subgraph of vertices of x such that g(x)=-1 and H be induced subgraph on the set of x such that g(x)=1. The sensitivity of f is the maximum number of neighbors of any vertex in G or H.<br />
<br />
Consider f as a multilinear polynomial over the reals. The sensitivity conjecture states there is some α>0 such that if f has degree n then f has sensitivity at least n<sup>α</sup>.<br />
<br />
Note g(x<sub>1</sub>,…,x<sub>n</sub>)=f(x<sub>1</sub>,…,x<sub>n</sub>)x<sub>1</sub>⋯x<sub>n</sub>. If f has a degree n term, the variables in that term cancel out on S (since x<sub>i</sub><sup>2</sup>=1) and the constant of the degree n term of f becomes the constant term of g. The constant term is just the expected value, so f has full degree iff g is unbalanced.<br />
<br />
GL Assumption: Suppose you have a partition of the hypercube into sets A and B with |A| ≠ |B|, and let G and H be the induced subgraphs of A and B. Then there is some constant α>0 such that there is a node of A or B with at least n<sup>α</sup> neighbors.<br />
<br />
The above argument, due to Gotsman and Linial, shows that the GL assumption is equivalent to the sensitivity conjecture.<br />
<br />
Huang proved that given any subset A of the vertices of a hypercube with |A|>2<sup>n</sup>/2 the induced subgraph has a node of degree at least n<sup>1/2</sup>. Since either A or B in the GL assumption has size greater than 2<sup>n</sup>/2, Huang's result gives the sensitivity conjecture. Lance Fortnowhttp://www.blogger.com/profile/06752030912874378610noreply@blogger.com0tag:blogger.com,1999:blog-3722233.post-80418366633150888062019-07-07T23:55:00.000-04:002019-07-07T23:55:55.092-04:00Fortran is underated!(Joint Post with David Marcus who was a classmate of mine at SUNY Stony Brook [now called Stony Brook University]. I was class of 1980, he was class of 1979. We were both math majors.)<br />
<br />
David has been reading <a href="https://www.amazon.com/Problems-Point-Exploring-Computer-Science/dp/9813279974">Problems with a POINT</a> (I'm glad someone is reading it) and emailed me a comment on the following passage which was essentially <a href="https://blog.computationalcomplexity.org/2012/02/dusting-off-my-bookshelf-i-find-book-on.html">this post</a>. I paraphrase what I wrote:<br />
<br />
PASSAGE IN BOOK:<br />
I dusted off my book shelves and found a book on Fortran. On the back it said:<br />
<br />
FORTRAN is one of the oldest high-level languages and remains the premier language for writing code for science and engineering applications. (NOTE- The back of the book uses Fortran but the spell checker I am using insists on FORTRAN. As a fan of capital letters, I don't mind going along.)<br />
<br />
When was the book written?<br />
<br />
The answer was surprising in that it was 2012 (the Chapter title was <i>Trick Question or Stupid Question</i>. This was a Trick Question.) I would have thought that FORTRAN was no longer the premier language by then. I also need to dust my bookshelves more often.<br />
END OF PASSAGE IN BOOK<br />
<br />
David Marcus emailed me the following:<br />
<br />
DAVID'S EMAIL<br />
Page 201. Fortran. One clue is that it said "Fortran" rather than"FORTRAN". Fortran 90 changed the name from all upper case. Whether it is the "premier language" depends on what you mean by "premier". It is probably the best language for scientific computing. I used it pretty much exclusively (by choice) in my previous job that I left in 2006. The handling of arrays is better than any other language I've used. Maybe there are some better languages that I'm not familiar with, but the huge number of high-quality scientific libraries available for Fortran makes it hard to beat. On the other hand, I never wrote a GUI app with it (Delphi is best for that).<br />
END OF DAVID'S EMAIL<br />
<br />
In later emails we agreed that Fortran is not used that much (there are lists of most-used languages and neither Fortran nor FORTRAN is ever in the top 10). But what intrigued me was the following contrast:<br />
<br />
1) David says that its the BEST language for Scientific Computing. I will assume he is right.<br />
<br />
2) I doubt much NEW code is being written in it. I will assume I am right.<br />
<br />
So---what's up with that? Some options<br />
<br />
OPTION 1) People SHOULD use Fortran but DON'T. If so, why is that? Fortran is not taught in schools. People are used to what they already know. Perhaps people who do pick up new things easily and want to use new things would rather use NEW things rather than NEW-TO-THEM-BUT-NOT-TO-THEIR-GRANDMOTHER things. Could be a coolness factor. Do the advantages of Fortran outweight the disadvantages? Is what they are using good enough?<br />
<br />
OPTION 2) The amount of Scientific computing software being written is small since we already have these great Fortran packages. So it may be a victim of its own success.<br />
<br />
CAVEAT: When I emailed David a first draft of the post he pointed out the following which has to do with the lists of most-used programming languages:<br />
<br />
DAVIDS EMAIL:<br />
The problem with the lists you were looking at is that most people in the world are not scientists, so most software being written is not for scientists. Scientists and technical people are writing lots of new code. If you look at a list of scientific languages, you will see Fortran, e.g., <a href="https://en.wikipedia.org/wiki/Scientific_programming_language">here</a> and <a href="https://en.wikipedia.org/wiki/Fortran#Science_and_engineering">here</a>.<br />
<br />
<br />
There are several Fortran compilers available. One of the best was bought by Intel some time back and they still sell it. I doubt they would do that if no one was using it. Actually, I think Intel had a compiler, but bought the Compaq compiler (which used to be the Digital Equipment compiler) and merged the Compaq team with their team. Something like that. I was using the Compaq compiler around that time.<br />
END OF DAVID's EMAIL<br />
<br />
One quote from the second pointer I find intriguing. (Second use of the word <i>intriguing</i>. It was my word-of-the-day on my word-calendar).<br />
<br />
<i>... facilities for inter-operation with C were added to Fortran 2003 and enhanced by ISO/ICE technical specification 29113, which will be incorporated into Fortran 2018. </i><br />
<br />
I (Bill) don't know what some of that means; however, it does mean that Fortran is still active.<br />
<br />
<br />
One fear: with its not being taught that much, will knowledge of it die out. We be like Star Trek aliens:<br />
<br />
<i>The old ones built these machines, but then died and we can't fix them!<br />
<br />
<br />
<br />
</i>GASARCHhttp://www.blogger.com/profile/03615736448441925334noreply@blogger.com7tag:blogger.com,1999:blog-3722233.post-89523017228511738572019-07-02T13:05:00.001-04:002019-07-02T21:11:31.933-04:00Local Kid Makes History<div class="separator" style="clear: both; text-align: center;">
</div>
<a href="https://1.bp.blogspot.com/-OpUgtDyqMf0/XRuOhVHWTFI/AAAAAAABplw/Tz0jTV3EQCo9w0aZ1bsI9xsJiec3OfytgCLcBGAs/s1600/Huang.jpg" imageanchor="1" style="clear: right; float: right; margin-bottom: 1em; margin-left: 1em;"><img border="0" data-original-height="324" data-original-width="266" height="200" src="https://1.bp.blogspot.com/-OpUgtDyqMf0/XRuOhVHWTFI/AAAAAAABplw/Tz0jTV3EQCo9w0aZ1bsI9xsJiec3OfytgCLcBGAs/s200/Huang.jpg" width="163" /></a>The <a href="https://www.scottaaronson.com/blog/?p=4229">blogosphere</a> is <a href="https://gilkalai.wordpress.com/2019/07/02/amazing-hao-huang-proved-the-sensitivity-conjecture/">blowing</a> <a href="https://windowsontheory.org/2019/07/02/sensitivity-conjecture-proved/">up</a> over Hao Huang's just <a href="https://arxiv.org/abs/1907.00847">posted proof</a> of the sensitivity conjecture, what was one of the more <a href="https://blog.computationalcomplexity.org/2017/12/razors-edge.html">frustrating open questions</a> in complexity.<br />
<br />
Huang, an assistant professor in the math department at Emory, settled an open question about the hypercube. The hypercube is a graph on N=2<sup>n</sup> vertices where each vertex corresponds to an n-bit string and their are edges between vertices corresponding to strings that differ in a single bit. Think of the set of the strings of odd parity, N/2 vertices with no edges between them. Add any other vertex and it would have n neighbors. Huang showed that no matter how you placed those N/2+1 vertices in the hypercube, some vertex will have at least n<sup>1/2</sup> neighbors. By an <a href="https://doi.org/10.1016/0097-3165(92)90060-8">old result</a> of Gotsman and Linial, Huang's theorem implies the sensitivity conjecture.<br />
<br />
I won't go through the shockingly simple proof, the <a href="https://arxiv.org/abs/1907.00847">paper</a> is well written, or you can read the blogs I linked to above or even just Ryan O'Donnell's <a href="https://twitter.com/BooleanAnalysis/status/1145837576487612416">tweet</a>.<br />
<br />
I have nothing more to say than wow, just wow.Lance Fortnowhttp://www.blogger.com/profile/06752030912874378610noreply@blogger.com2tag:blogger.com,1999:blog-3722233.post-70547571782935571822019-06-30T22:34:00.001-04:002019-07-08T15:46:03.126-04:00A proof that 22/7 - pi > 0 and more<br />
My father was a High School English teacher who did not know much math. As I was going off to college, intending to major in math, he gave me the following sage advice:<br />
<br />
1) <i>Take Physics as well as Math since Physics and Math go well together.</i> This was good advice. I took the first year of Physics for Physics Majors, and I later took a senior course in Mechanics since that was my favorite part of the first year course. Kudos to Dad!<br />
<br />
2) π <i>is exactly </i>22/7. I knew this was not true, but I also knew that I had no easy way to show him this. In fact, I wonder if I could have proven it myself back then.<br />
<br />
I had not thought about this in many years when I came across the following:<br />
<br />
Problem A-1 on the 1968 Putnam exam:<br />
<br />
Prove 22/7 - π = ∫<sub>0</sub><sup>1</sup> (x<sup>4</sup>(1-x)<sup>4</sup>)/(1+ x<sup>2</sup> )dx<br />
<br />
(I can easily do his by partial fractions and remembering that ∫ 1/(1+x^2) dx = tan<sup>-1</sup>x which is tan inverse, not 1/tan. See <a href="https://www.cs.umd.edu/users/gasarch/BLOGPAPERS/pi.pdf">here</a>.)<br />
<br />
(ADDED LATER---I have added conjectures on getting integrals of the form above except with 4 replaced by any natural number. Be the first on your block to solve my conjectures! It has to be easier than the Sensitivity Conjecture!)<br />
<br />
<br />
<br />
Let n ∈ N which we will choose later. By looking at the circle that is inscribed in a regular n-polygon (n even) one finds that <br />
<br />
<br />
n tan(π/n) > π <br />
<br />
<br />
So we seek an even value of n such that<br />
<br />
<br />
n tan(π/n) < 22/7<br />
<br />
<br />
Using Wolfram alpha the smallest such n is 92.<br />
<br />
Would that convince Dad? Would he understand it? Probably not. Oh well.<br />
<br />
Some misc points.<br />
<br />
<br />
1) While working on this post I originally wanted to find tan(π/2<sup>7</sup>) by using the half-angle formula many times, and get an exact answer in terms of radicals, rather than using Wolfram Alpha. <br />
<br />
a) While I have lots of combinatorics books, theory of comp books, and more Ramsey Theory books than one person should own in my house, I didn't have a SINGLE book with any trig in it.<br />
<br />
b) I easily found it on the web: <br />
<br />
tan(x/2) = sqrt( (1-cos x)/(1+cos x) ) = sin x/(1+cos x) = (1-cos x)/(sin x).<br />
<br />
None of these seems like it would get me a nice expression for tan(π/2<sup>7</sup>). But I don't know. Is there a nice expression for tan(π/2<sup>k</sup>) ? If you know of one then leave a polite comment.<br />
<br />
2) I assumed that there was a more clever and faster way to do the integral. I could not find old Putnam exams and their solutions the web (I'm sure they are there someplace! --- if you know then comment politely with a pointer). So I got a book out of the library <i>The William Lowell Putnam Mathematical Competition Problems and Solutions 1965--1984</i> by Alexanderson, Klosinski, and Larson. Here is the clever solution:<br />
<br />
<i>The standard approach from Elementary Calculus applies.<br />
<br />
</i><br />
<br />
Not as clever as I as hoping for.<br />
<br />
3) I also looked at the integral with 4 replaced by 1,2,3,4,...,16. The results are in the writeup I pointed to before. It looks like I can use this sequence to get upper and lower bound on pi, ln(2), pi+2ln(2), and pi-2ln(2). I have not proven any of this. But take a look! And as noted above I have conjectures!<br />
<br />
<br />
4) When I looked up INSCRIBING a circle in a regular n-polygon, Google kept giving me CIRCUMSCRIBING. Why? I do not know but I can speculate. Archimedes had a very nice way of using circumscribed circles to approximate pi. Its on youtube <a href="https://www.youtube.com/watch?v=_rJdkhlWZVQ">here</a>. Hence people are used to using circumscribed rather than inscribed circles.<br />
<br />
GASARCHhttp://www.blogger.com/profile/03615736448441925334noreply@blogger.com7tag:blogger.com,1999:blog-3722233.post-57036124854956871122019-06-27T16:34:00.001-04:002019-06-28T11:27:36.082-04:00FCRC 2019<table align="center" cellpadding="0" cellspacing="0" class="tr-caption-container" style="margin-left: auto; margin-right: auto; text-align: center;"><tbody>
<tr><td style="text-align: center;"><a href="https://1.bp.blogspot.com/-1zksIfUU-7U/XRToEil7J7I/AAAAAAABpiI/nR4seqK1l08FfLoalQyM2OzdK3iZTwL2ACKgBGAs/s1600/MVIMG_20190626_112006_1.jpg" imageanchor="1" style="margin-left: auto; margin-right: auto;"><img border="0" data-original-height="1201" data-original-width="1600" height="240" src="https://1.bp.blogspot.com/-1zksIfUU-7U/XRToEil7J7I/AAAAAAABpiI/nR4seqK1l08FfLoalQyM2OzdK3iZTwL2ACKgBGAs/s320/MVIMG_20190626_112006_1.jpg" width="320" /></a></td></tr>
<tr><td class="tr-caption" style="text-align: center;">Georgia Tech FCRC Participants</td></tr>
</tbody></table>
I'm heading home from the <a href="https://fcrc.acm.org/">2019 ACM Federated Computing Research Conference</a> in Phoenix, a collection of computer science meetings including <a href="http://acm-stoc.org/stoc2019/">STOC</a>, <a href="http://learningtheory.org/colt2019/">COLT</a> and <a href="http://www.sigecom.org/ec19/">EC</a>.<br />
<br />
Geoff Hinton and Yann LeCun gave their Turing award lectures, their co-winner Yoshua Bengio not in attendance. Hinton talked about how machine learning triumphed over symbolic AI. LeCun argued that under uncertainty, one should learn the distribution instead of just the average. If you want more, just <a href="https://fcrc.acm.org/turing-lecture-at-fcrc-2019">watch it yourself</a>.<br />
<div style="text-align: left;">
<br /></div>
<div style="text-align: left;">
To get to the STOC lectures you go up and down escalators and pass through ISCA (Computer Architecture) and PLDI (Programming Languages). It's like you are going up the computing stack until you reach algorithms and complexity. </div>
<div style="text-align: left;">
<br />
The conference center was just two blocks from Chase Field so we could take in a Diamondbacks baseball game. They opened the roof because the temperature dropped into the double digits. Last night, Paul McCartney played at an arena just a block from the conference center, but instead I hung out at an Uber reception for the EC conference.<br />
<br /></div>
<div style="text-align: left;">
Let me mention a best paper awardee, <a href="https://doi.org/10.1145/3313276.3316369">The Reachability Problem for Petri Nets is Not Elementary</a> by Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jerome Leroux and Filip Mazowiecki. In a Petri net you have a list of vectors of integers and an initial and final vector. You start with the initial vector and can add any of the other vectors nondeterministically as often as you like as long as no coordinate goes negative. Can you get to the final vector? This problem was known to be computable in "Ackermannian" time and EXPSPACE-hard. This paper shows the problem is not elementary, i.e. not solvable in running time a tower of 2's to the n. A <a href="https://arxiv.org/abs/1903.08575">recent result</a> shows Petri Nets reachability is primitive recursive for fixed dimensions.<br />
<br />
Avi Wigderson gave the Knuth Prize lecture exploring deep connections between mathematics and algorithms. Hopefully the video will be online soon.<br />
<br />
STOC next year in Chicago, EC as part of the Game Theory Congress in Budapest. </div>
Lance Fortnowhttp://www.blogger.com/profile/06752030912874378610noreply@blogger.com2tag:blogger.com,1999:blog-3722233.post-88036890436887612392019-06-24T01:03:00.003-04:002019-06-24T01:03:12.211-04:00Are you smarter than a 5th grade amoeba?(title of this blog is due to Henry Baker who posted an article about this elsewhere)<br />
<br />
Amoeba finds approx solution to TSP in linear time:<a href="https://phys.org/news/2018-12-amoeba-approximate-solutions-np-hard-problem.html">here</a>.<br />
<br />
Over the years we have seen models of computation that claim to solve NPC or other hard problems quickly. I ask non-rhetorically and with and open mind how they have panned out.<br />
<br />
In no particular order:<br />
<br />
1) Parallelism. For solving problems faster YES. For speeding up how to solve NPC problems I think YES. For making P=NP somehow NO. Even so, parallel computers have been a definite practical success.<br />
<br />
2) Quantum Computing. Will they factor large numbers anytime soon? Ever? Should we view the effort to build them as an awesome and insightful Physics experiment? Are there any problems that they are NOW doing faster? Is Quantum Crypto (I know, not the same thing) actually used? Will other things of interest come out of the study of quantum computing? It already has, see <a href="https://theoryofcomputing.org/articles/gs002/gs002.pdf">here</a>.<br />
<br />
3) DNA computing. Did that lead to practical solutions to NPC problems? I do not think it did. Did that lead to interesting math? Interesting biology? Interesting science? I do not know.<br />
<br />
4) Autistic computing for finding primes: see <a href="https://blog.computationalcomplexity.org/2009/09/possibly-recruits-for-polymath-primes.html">here</a>. Oliver Sacks, the neurologist ,claimed that two autistic twin brothers could generate large primes quickly. This story was never put to a rigorous test and may not be quite right.<br />
<br />
5) Amoeba computing: Too early to tell. The article seems to say it succeeded on 8 cities<br />
<br />
The problem with all of these non-standard models of computing is SCALE. And the more powerful classic computers get, the harder it is for these nonstandard models to compete.<br />
<br />
Are these models interesting even if they don't end up getting us fast algorithms? They can be:<br />
<br />
1) Do they lead to mathematics of interest? (Quantum- Yes, Parallelism- Yes)<br />
<br />
2) Did they inspire algorithms for classical computers? (Quantum- Yes)<br />
<br />
3) Do they give insight into other fields? (Quantum for Physics yes, DNA-computing for bio-??)<br />
<br />
4) Have they ACTUALLY sped up up computations in meaningful ways for problems we care about (Parallelism has)<br />
<br />
If you know of any result which I missed<br />
<br />
(e.g.,<br />
<br />
Amoeba-computing giving insight into evolution,<br />
<br />
Autistic computing being used by the NSA to find primes,<br />
<br />
DNA computing leading to interesting mathematics)<br />
<br />
then leave polite comments!<br />
<br />
<br />
<br />
<br />
<br />
<br />GASARCHhttp://www.blogger.com/profile/03615736448441925334noreply@blogger.com4tag:blogger.com,1999:blog-3722233.post-87188808468938776932019-06-20T09:18:00.000-04:002019-06-20T09:18:07.629-04:00The Urban/Rural Collegiality Divide<div>
Just a reminder that Grigory Yaroslavtsev has <a href="http://grigory.us/blog/theory-jobs-2019/">taken over</a> the <a href="https://docs.google.com/spreadsheets/d/1Oegc0quwv2PqoR_pzZlUIrPw4rFsZ4FKoKkUvmLBTHM/edit?usp=sharing">Theory Jobs Spreadsheet</a>. Check out who is moving where and let everyone know where you will continue your research career.</div>
<div>
<br /></div>
In 1999 when I considered leaving the University of Chicago for NEC Research I had a conversation with Bob Zimmer, then VP of Research and current U of C President. Zimmer said it was a shame I didn't live in Hyde Park, the Chicago South Side neighborhood where the university resides, and thus not fully connected with the school. At the time I didn't fully understand his point and did leave for NEC, only to return in 2003 and leave again in 2008. I never did live in Hyde Park.<br />
<div>
<br /></div>
<div>
Recently I served on a review committee for a computer science department in a rural college town. You couldn't help but notice the great collegiality among the faculty. Someone told me their theory that you generally get more faculty collegiality in rural versus urban locations. Why?</div>
<div>
<br /></div>
<div>
In urban locations faculty tend to live further from campus, to get bigger homes and better schools, and face more traffic. They are likely to have more connections with people unconnected with the university. There are more consulting opportunities in large cities, a larger variety of coffee houses to hang out in and better connected airports make leaving town easier. Particularly in computer science, where you can do most of your research remotely, faculty will find themselves less likely to come in every day and you lose those constant informal connections with the rest of the faculty. </div>
<div>
<br /></div>
<div>
This is a recent phenomenon, even going back to when I was a young faculty you needed to come to the office for access to research papers, better computers to write papers, good printers. Interactions with students and colleagues is always better in person but in the past the methods of electronic communication proved more limiting.</div>
<div>
<br /></div>
<div>
The University of Chicago helped create and promote its own neighborhood and ran a very strong private school with reduced tuition for faculty children. Maybe my life would have been different had I immersed myself in that lifestyle. </div>
<div>
<br /></div>
<div>
Or maybe we should go the other extreme. If we can find great ways to do on-line meetings and teaching, why do we need the physical university at all?</div>
Lance Fortnowhttp://www.blogger.com/profile/06752030912874378610noreply@blogger.com5tag:blogger.com,1999:blog-3722233.post-25929654746028599392019-06-17T20:59:00.000-04:002019-06-17T20:59:41.365-04:00Why does the Nevalina Prize (now Abacus) got to Algorithms/Complexity peopleIn my post about the Nevanlinna prize name change (see <a href="https://blog.computationalcomplexity.org/2019/06/imus-non-controversial-changing-name-of.html">here</a>) one of my readers raised a different question about the prize:<br />
<br />
BEGIN QUOTE<br />
<br />
<div style="text-align: start;">
<br /></div>
<span style="background-color: #ccff99; color: #191919; font-family: "georgia" , "utopia" , "palatino linotype" , "palatino" , serif; font-size: 14px; text-align: justify;">So there's one of my main questions about the prize answered (or at least resolved). The second remains. The IMU's website(which still refers to the Nevanlinna Prize) says that it is awarded "for outstanding contributions in Mathematical Aspects of Information Sciences including:"</span><br />
<br style="background-color: #ccff99; color: #191919; font-family: Georgia, Utopia, "Palatino Linotype", Palatino, serif; font-size: 14px; text-align: justify;" />
<span style="background-color: #ccff99; color: #191919; font-family: "georgia" , "utopia" , "palatino linotype" , "palatino" , serif; font-size: 14px; text-align: justify;">1)All mathematical aspects of computer science, including complexity theory, logic of programming languages, analysis of algorithms, cryptography, computer vision, pattern recognition, information processing and modelling of intelligence.</span><br />
<br style="background-color: #ccff99; color: #191919; font-family: Georgia, Utopia, "Palatino Linotype", Palatino, serif; font-size: 14px; text-align: justify;" />
<span style="background-color: #ccff99; color: #191919; font-family: "georgia" , "utopia" , "palatino linotype" , "palatino" , serif; font-size: 14px; text-align: justify;">2)Scientific computing and numerical analysis. Computational aspects of optimization and control theory. Computer algebra.</span><br />
<br style="background-color: #ccff99; color: #191919; font-family: Georgia, Utopia, "Palatino Linotype", Palatino, serif; font-size: 14px; text-align: justify;" />
<span style="background-color: #ccff99; color: #191919; font-family: "georgia" , "utopia" , "palatino linotype" , "palatino" , serif; font-size: 14px; text-align: justify;">Correct me if I'm wrong, but it seems that the recognized work of the ten winners of the award all fits into two or three of the possible research areas for which the prize may be rewarded. Why do people think that this is the case?</span><br />
<br />
<br />
<div style="text-align: justify;">
<span style="color: #191919; font-family: "georgia" , "utopia" , "palatino linotype" , "palatino" , serif;"><span style="background-color: #ccff99; font-size: 14px;">END QUOTE</span></span></div>
<div style="text-align: justify;">
<span style="color: #191919; font-family: "georgia" , "utopia" , "palatino linotype" , "palatino" , serif;"><span style="background-color: #ccff99; font-size: 14px;"><br /></span></span></div>
<div style="text-align: justify;">
<span style="color: #191919; font-family: "georgia" , "utopia" , "palatino linotype" , "palatino" , serif;"><span style="background-color: #ccff99; font-size: 14px;">First off, lets see if this is true. Here is a list of all the winners:</span></span></div>
<div style="text-align: justify;">
<span style="color: #191919; font-family: "georgia" , "utopia" , "palatino linotype" , "palatino" , serif;"><span style="background-color: #ccff99; font-size: 14px;"><br /></span></span></div>
<div style="text-align: justify;">
<span style="color: #191919; font-family: "georgia" , "utopia" , "palatino linotype" , "palatino" , serif;"><span style="background-color: #ccff99; font-size: 14px;">Tarjan, Valiant, Razborov, Wigderson, Shor, Sudan, Kleinberg, Spielman, Khot, Daskalakis </span></span><br />
<span style="color: #191919; font-family: "georgia" , "utopia" , "palatino linotype" , "palatino" , serif;"><span style="background-color: #ccff99; font-size: 14px;"><br /></span></span>
<span style="color: #191919; font-family: "georgia" , "utopia" , "palatino linotype" , "palatino" , serif;"><span style="background-color: #ccff99; font-size: 14px;">Yup, they all seem to be in Algorithms or Complexity.</span></span><br />
<span style="color: #191919; font-family: "georgia" , "utopia" , "palatino linotype" , "palatino" , serif;"><span style="background-color: #ccff99; font-size: 14px;"><br /></span></span>
<span style="color: #191919; font-family: "georgia" , "utopia" , "palatino linotype" , "palatino" , serif;"><span style="background-color: #ccff99; font-size: 14px;">Speculation as to why:</span></span><br />
<span style="color: #191919; font-family: "georgia" , "utopia" , "palatino linotype" , "palatino" , serif;"><span style="background-color: #ccff99; font-size: 14px;"><br /></span></span>
<span style="color: #191919; font-family: "georgia" , "utopia" , "palatino linotype" , "palatino" , serif;"><span style="background-color: #ccff99; font-size: 14px;">1) Algorithms and Complexity have problems with short descriptions that can easily be understood: Tarjan proved Planarity was in O(n) time. Valiant defined Sharp-P and showed the Permanent was Sharp-P complete. Hence it is easy to see what they have done. In many of the fields listed, while people have done great work, it may be harder to tell since the questions are not as clean. If my way to do Vision is better than your way to do Vision, that may be hard to prove. And the proof may need to be non-rigorous.</span></span><br />
<span style="color: #191919; font-family: "georgia" , "utopia" , "palatino linotype" , "palatino" , serif;"><span style="background-color: #ccff99; font-size: 14px;"><br /></span></span>
<span style="color: #191919; font-family: "georgia" , "utopia" , "palatino linotype" , "palatino" , serif;"><span style="background-color: #ccff99; font-size: 14px;">2) If someone does great work in (for example) Logic of Programming Languages, it may not be recognized until she is past 40 years old. </span></span><br />
<span style="color: #191919; font-family: "georgia" , "utopia" , "palatino linotype" , "palatino" , serif;"><span style="background-color: #ccff99; font-size: 14px;"><br /></span></span>
<span style="color: #191919; font-family: "georgia" , "utopia" , "palatino linotype" , "palatino" , serif;"><span style="background-color: #ccff99; font-size: 14px;">3) This one I am less sure of (frankly I'm not that sure of any of these and invite polite commentary): areas that are more practical may take longer to build and get to work.</span></span><br />
<span style="color: #191919; font-family: "georgia" , "utopia" , "palatino linotype" , "palatino" , serif;"><span style="background-color: #ccff99; font-size: 14px;"><br /></span></span>
<span style="color: #191919; font-family: "georgia" , "utopia" , "palatino linotype" , "palatino" , serif;"><span style="background-color: #ccff99; font-size: 14px;">But there is still a problem with this. Numerical Analysis and Cryptography would seem to not have these problems. </span></span><br />
<span style="color: #191919; font-family: "georgia" , "utopia" , "palatino linotype" , "palatino" , serif;"><span style="background-color: #ccff99; font-size: 14px;"><br /></span></span>
<span style="color: #191919; font-family: "georgia" , "utopia" , "palatino linotype" , "palatino" , serif;"><span style="background-color: #ccff99; font-size: 14px;">I invite the reader to speculate</span></span></div>
GASARCHhttp://www.blogger.com/profile/03615736448441925334noreply@blogger.com4tag:blogger.com,1999:blog-3722233.post-80195001661638461732019-06-12T12:27:00.000-04:002019-06-12T12:27:25.435-04:00Compressing in Moscow<div class="separator" style="clear: both; text-align: center;">
</div>
<div class="separator" style="clear: both; text-align: center;">
<a href="https://1.bp.blogspot.com/-Bisdr756vxM/XQDylk3YrYI/AAAAAAABozI/M1FgKQZyX08bscqjoy9wmF8BxtXG86RLACLcBGAs/s1600/Vereshchagin.jpg" imageanchor="1" style="clear: right; float: right; margin-bottom: 1em; margin-left: 1em;"><img border="0" data-original-height="190" data-original-width="190" src="https://1.bp.blogspot.com/-Bisdr756vxM/XQDylk3YrYI/AAAAAAABozI/M1FgKQZyX08bscqjoy9wmF8BxtXG86RLACLcBGAs/s1600/Vereshchagin.jpg" /></a><a href="https://1.bp.blogspot.com/-G6yjxH8R1pU/XQDylvxG2aI/AAAAAAABozE/P54lQPWWEa46pTgyDEi6QWQOsaWLxP5zwCLcBGAs/s1600/Shen.jpg" imageanchor="1" style="clear: left; float: left; margin-bottom: 1em; margin-right: 1em;"><img border="0" data-original-height="190" data-original-width="190" src="https://1.bp.blogspot.com/-G6yjxH8R1pU/XQDylvxG2aI/AAAAAAABozE/P54lQPWWEa46pTgyDEi6QWQOsaWLxP5zwCLcBGAs/s1600/Shen.jpg" /></a></div>
<br />
This week finds me in Moscow for a pair of workshops, the <a href="https://mipt.ru/education/chairs/dm/conferences/workshop-june-9-11-moscow-2019.php">Russian Workshop on Complexity and Model Theory</a> and a workshop on <a href="https://www.poncelet.ru/conference/ric">Randomness, Information and Complexity</a>. The latter celebrates the lives of Alexander Shen and Nikolay Vereshchagin on their 60th birthdays.<br />
<br />
Alexander Shen might be best known in computational complexity for his <a href="https://doi.org/10.1145/146585.146613">alternate proof</a> of IP = PSPACE. In 1989, Lund, Fortnow, Karloff and Nisan gave an interactive proof for the permanent, which got the entire polynomial-time hierarchy by Toda's theorem. But we didn't know how to push the protocol to PSPACE, we had a problem keeping degrees of polynomials low. Shamir had the first proof by looking at a specific protocol for PSPACE. Shen had the brilliant but simple idea to use a degree reducing operator, taking the polynomial modulo x<sup>2</sup>-x. The three papers appeared <a href="https://dl.acm.org/citation.cfm?id=146585#prox">back-to-back-to-back</a> in JACM.<br />
<br />
Shen and Vereshchagin though made their careers with their extensive work on Kolmogorov complexity and entropy, often together. Vereshchagin and I have co-authored some papers together during our mutual trips to Amsterdam, including on <a href="http://doi.org/10.1007/11672142_10">Kolmogorov Complexity with Errors</a> and how to <a href="http://doi.org/10.1007/b106485">increase Kolmogorov Complexity</a>. My <a href="https://doi.org/10.1006/jcss.1999.1677">favorite work</a> of Shen and Vereshchagin, which they did with Daniel Hammer and Andrei Romashchenko showed that every linear inequality that holds for entropy also holds for Kolmogorov complexity and vice-versa, the best argument that the two notions of information, one based on distributions, the other based on strings, share strong connections.<br />
<br />
Today is <a href="https://en.wikipedia.org/wiki/Russia_Day">Russia Day</a> that celebrates the reestablishment of Russia out of the Soviet Union in 1990. Just like how the British celebrate their succession from the US in 1776 I guess. But I'm celebrating Russia day by honoring these two great Russians. Congrats Sasha and Kolya!Lance Fortnowhttp://www.blogger.com/profile/06752030912874378610noreply@blogger.com0tag:blogger.com,1999:blog-3722233.post-88724380043367454992019-06-08T14:35:00.003-04:002019-06-08T14:35:45.755-04:00Ray Miller, one of our founders, Passes away at the age of 90Ray Miller, one of the founders of our field, passed away recently at the age of 90.<br />
<br />
He has associations with both GA Tech and The University of Maryland, so both Lance and I have a connection to him. As does Dick Lipton who has posted about him <a href="https://rjlipton.wordpress.com/2019/06/08/raymond-edward-miller-just-passed-away/">here</a>.<br />
<br />
I present two guest blog-posts about him<br />
<br />
<br />
<b>Post One</b>: From<br />
<br />
<a href="https://www.cs.umd.edu/people/lin">Ming C Lin</a><br />
<br />
Elizabeth Stevinson Chair of Computer Science<br />
<br />
University of Maryland at College Park<br />
<br />
<br />
Dear CS Alumni and Friends,<br />
<br />
We are deeply saddened to learn that Professor Emeritus Ray Miller passed away two nights ago around 9 pm.<br />
<br />
A Memorial Service at St. Andrews Lutheran Church (15300 New Hampshire Ave., Silver Spring MD 20905) for Dr. Miller will be held on Saturday, June 15th at 10:30 am.<br />
<br />
Dr. Ray Miller received his Ph.D. from University of Illinois in 1957. He was a professor and the former Director of the School of Information and Computer Science at the Georgia Institute of Technology before joining our department in 1988 as the Director of the Center of Excellence in Space Data and Information Science (CESDIS). Dr. Miller was well known for his research on communication protocols, networks, distributed systems, parallel computation, and theory.<br />
<br />
In 1970, he became the Fellow of IEEE for the advancement of the theoretical understanding of computation through work in switching theory and theoretical models.<br />
<br />
In 1997, he was elevated to be a Fellow of ACM for research contributions to the theory of parallel computation and for his distinguished service to the Computer Science community as an educator and leader.<br />
<br />
In 2003, Dr. Miller was designated as a Fellow by the Computer Science Accreditation Board<br />
<br />
<i>"in recognition of his outstanding professional volunteer contributions to computing sciences </i><i>and accreditation”.</i><br />
<br />
Dr. Miller was also an AAAS Fellow, and a Charter Member of IEEE Computer Society Golden Core;he received the IEEE Third Millennium Medal in 2000 and ACM Distinguished Service Award in 2002.<br />
<br />
Beyond his outstanding research contribution and devotion to education, Dr. Ray Miller has been known for his kindness as a colleague, supportiveness as a mentor, and effectiveness as a leader. Dr. Miller will be forever remembered warmly by his friends, colleagues and students for his dedication and service to our department, the University, and the field of computing at large.<br />
<br />
<br />
<b>Post Two</b>: From<br />
<br />
<a href="http://www.cs.umd.edu/users/ben/">Ben Shneiderman</a><br />
<br />
Emeritus Professor, University of Maryland at College Park.<br />
<br />
I was saddened to hear about the death of Ray Miller at age 90. He was a dear colleague who contributed a great deal to computer science and to our department. You can read his 84-page personal memoir at the IEEE Computer Society History Committee website: <a href="https://history.computer.org/pubs/ray-miller.pdf">here</a>.<br />
<br />
His memoirs tells his story in detail, describing his research collaborations in computational complexity, parallel algorithms, and program optimization and his leadership roles. You can see more about Ray’s work on his ACM author page: <a href="https://dl.acm.org/author_page.cfm?id=81332515760">here</a><br />
<br />
<div>
This is the best source as he had no Google Scholar page or Wikipedia article that I could find. Ray’s quiet and modest style was a valuable asset, but his contributions come through in his memoir. He describes working with Turing Awardees John Cocke, Fran Allen, John Backus, Dick Karp, and other key figures, so maybe Ray should have received that award too. Ray was also an excellent administrator and leader, who contributed to building the institutions (conferences, ACM, IEEE, etc.) that supported the growth of computer science.</div>
<div>
<div>
<br /></div>
<div>
Ray was especially kind to me in the early 1970s, when I was working on my Phd, developing a graph theoretic model of data structures. As Assistant Director of the IBM Mathematical Science Department at the T. J. Watson Labs in Yorktown Heights, NY. This legendary IBM Research Lab was equal to Bell Labs and filled with computing pioneers in hardware, software, and applications.<br />
<br /></div>
<div>
Ray invited me to give a talk about my work, drawing interest from Arnold Rosenberg, who had been developing related ideas. With Ray’s support I returned for monthly visits with Arnie and Ray to refine my esoteric ideas leading to my May 1973 Phd.</div>
<div>
<br /></div>
<div>
Ray’s kindness as a colleague and supportiveness as a mentor will always be remembered warmly. Here are a few photos of Ray giving a talk in the CS Department, probably in 1985: <a href="https://www.cs.umd.edu/users/gasarch/BLOGPAPERS/ray1.jpg">here,</a> <a href="https://www.cs.umd.edu/users/gasarch/BLOGPAPERS/ray2.jpg">here</a>, and</div>
</div>
<div>
<a href="https://www.cs.umd.edu/users/gasarch/BLOGPAPERS/ray3.jpg">here</a></div>
GASARCHhttp://www.blogger.com/profile/03615736448441925334noreply@blogger.com0tag:blogger.com,1999:blog-3722233.post-13815010928948494522019-06-06T10:46:00.001-04:002019-06-06T10:46:29.214-04:00What Happened to the Surprising Theorems?Twenty-five years ago Peter Shor presented a polynomial-time factoring algorithms for quantum computers. For Peter, it was a simple translation of a <a href="https://en.wikipedia.org/wiki/Simon%27s_problem">quantum algorithm</a> due to Dan Simon. For the rest of us, it was a shock, while we knew quantum could do some seemingly artificial problems exponentially faster, no one expected a natural problem like factoring to fall so quickly. I remember remarking at the time that Shor bought quantum computing twenty years, now I would say fifty.<br />
<div>
<br /></div>
<div>
That may have been the last time I was truly shocked by a theorem in theoretical computer science. I've been shocked by proofs, that Primes are in P, Undirected connectivity in Log space, NEXP not in ACC<sup>0</sup>, Graph Isomorphism in quasi-polynomial time. But the theorems themselves all went in the directions we expected.<br />
<br />
In the ten years before Shor we had plenty of surprises, interactive proofs, zero-knowledge proofs, probabilistically checkable proofs, nondeterministic space closed under complementation, hardness versus randomness, the permanent hard for the polynomial-time hierarchy. It seemed to come to a hard stop after Shor.<br />
<br />
There have been some mild surprises, the Hadamard isn't rigid, holographic algorithms, the complexity of Nash equilibrium, QIP = PSPACE, and many others. But nothing that has made us rethink the complexity world.<br />
<br />
This reflects the maturity of our field. How many shocking theorems have we seen recently in math in general? We're shocked by proofs of the Poincaré conjecture and Fermat's last theorem but both went in the expected direction.<br />
<br />
We will have some shocking theorem in the future, maybe Factoring in P or L = NL. To be truly shocked it would have to be something I can't even imagine being true today.</div>
Lance Fortnowhttp://www.blogger.com/profile/06752030912874378610noreply@blogger.com11tag:blogger.com,1999:blog-3722233.post-31169954073431456042019-06-04T11:53:00.000-04:002019-06-04T11:53:51.084-04:00IMU's non-controversial changing the name of the Nevanlinna Prize(I want to thank Alexander Soifer for supplying me with some of the documents I point to in this post. We should all thank him for getting the ball rolling on changing the name of the Nevanlinna Prize.)<br />
<br />
The <i>Nevanlinna Prize </i>was essentially a Fields Medal for Theoretical Computer Science. I do not know why it is a<i> Prize </i>instead of a <i>Medal.</i><br />
<div>
<br /></div>
<div>
It has been renamed <i>The Abacus Medal. </i>If you want to know why the IMU (International Mathematics Union) thinks the new name is good <i>but do not </i><i>care even a little about why the original name was bad</i> then see this article: <a href="https://www.heidelberg-laureate-forum.org/blog/imu-abacus-medal/">here</a>.</div>
<div>
<br /></div>
<div>
So why is <i>The Nevanlinna Prize</i> a bad name? In brief, Rolf Nevanlinna was an enthusiastic Nazi sympathizer. How enthused? He served as the chair of the Finish SS recruitment committee.<br />
<br />
That would seem like enough to get the name changed. In fact, it makes one wonder why the prize originally had the name.<br />
<br />
1) Why the change now? It began when Alexander Soifer came across this information about Nevanlinna while working on his book<br />
<br />
<i>The Scholar and the State: In Search of Van der Waerdan</i> (see <a href="https://amzn.to/2WnfDYh">here</a> to buy it, see <a href="https://mathcs.clarku.edu/~fgreen/SIGACTReviews/bookrev/47-1.pdf">here</a> for a book review column that includes my review of it).<br />
<br />
He then wrote a letter to the IMU which sponsors the <i>Nevanlinna Prize</i>. The letter is <a href="https://www.cs.umd.edu/users/gasarch/BLOGPAPERS/letterToImu.pdf">here</a>. Note that Alexander offered to pay for the prize ($15,000 every four years) if that will help get the name changed.<br />
<br />
After a response that lamely said (I paraphrase): <i>Gee, we didn't know. Oh well</i>. Alex wrote another letter which is <a href="https://www.cs.umd.edu/users/gasarch/BLOGPAPERS/letterToImu2.pdf">here</a>.<br />
<br />
The story has a happy ending: the name was changed. (No, Alexander is not paying for the award.)<br />
<br />
2) For a full summary of why the award was originally named Nevanlinna and why it was changed see the article, <i>Yes We Can, </i>by Alexander Soifer,<i> </i>in an issue of the journal <i>Mathematical Competition</i>s, see <a href="https://www.cs.umd.edu/users/gasarch/BLOGPAPERS/yeswecan.pdf">here</a>.</div>
<div>
<br /></div>
<div>
3) When is change possible?<br />
<br /></div>
<div>
Assume Y did X and X is awful (e.g., I assume for most of my readers believing and spreading Nazi propaganda). Assume there is a Y-prize. What does it take to have the name changed?<br />
<br /></div>
<div>
<br /></div>
<div>
a) You need someone pushing hard for it. Kudos to Alexander Soifer who started this.</div>
<div>
<br /></div>
<div>
b) There is no really good reason to use that name in the first place. </div>
<div>
<br /></div>
<div>
What was Nevanlinna's contribution to mathematical aspects of computer science? The IMU (International Mathematics Union) internet page answers:</div>
<div>
<br /></div>
<div>
<i>The prize was named in honors of Rolf Nevanlinna ... who in the 1950's had taken the initiative to the computer organization at Finnish Universities. </i></div>
<div>
<i><br /></i></div>
<div>
That's all. If there was a Gauss Prize (actually there IS a Gauss Prize) and we later found out that Gauss was X, I doubt we would change the name of the award. Gauss's name is on it since he is a great mathematician. </div>
<div>
<br /></div>
<div>
c) The person on the award is not the one giving the money. If we found out that Nobel was an X, I doubt the name would change since he is paid for it. </div>
<div>
<br /></div>
<div>
d) If the award name is well known then it might not change. Nobel is a good example. I think the Nevanlinna prize is mostly unknown to the public. The Field's medal is better known, though still not that well known. The general public became briefly aware of the Field's medal twice: when it was mentioned in the movie <i>Good Will Hunting,</i> and when Perelman turned it down. Fame is fleeting for both prizes and people.</div>
<div>
<br /></div>
<div>
e) Organizations don't like to change things. Hence X would need to be particularly bad to warrant a name change. </div>
<div>
<br /></div>
<div>
OTHER THOUGHTS</div>
<div>
<br /></div>
<div>
1) Why <i>The Abacus Medal</i>? Perhaps they are worried that if they name it after someone and that someone turns out to be an X they'll have to change it again. I find the explanation given <a href="https://www.heidelberg-laureate-forum.org/blog/imu-abacus-medal/">here</a> to be unsatisfying. I find the fact that they make <b>NO MENTION</b> of why they are no longer naming it <i>The</i> <i>Nevanlinna prize </i>appalling and insulting.</div>
<div>
<br /></div>
<div>
2) Lets turn to people who get the awards. If someone solved two Millennium problems and clearly deserved a Field's Medal, but was an X, should they be denied the prize on that basis. I would tend to think no (that is, they should get the prize) but it does trouble me. What would happen? I honestly don't know. </div>
<div>
<br /></div>
<div>
3) X will change over time.</div>
<div>
<br /></div>
GASARCHhttp://www.blogger.com/profile/03615736448441925334noreply@blogger.com9tag:blogger.com,1999:blog-3722233.post-10403818935691715462019-05-29T16:09:00.001-04:002019-05-29T16:09:33.165-04:00NSF PanelsThe government shut down in January led to delays at the National Science Foundation and only recently announcing decisions on grants submitted last fall. For those who successfully received awards, congratulations! For those who didn't, don't take it personally, buckle up and try again.<br />
<br />
For those who don't know how the process works, for each grant program, the program directors organize one or more panels which typically meets in person at NSF headquarters in Alexandria, Virginia. A typical panel has about a dozen panelists and twenty or so proposals. Before the panels, each proposal gets at least three reviews by the panelists. Discussions ensue over a day or two, proposals get sorted into categories: Highly Competitive, Competitive, Low Competitive and Not Competitive and then ranked ordered in the top categories.<br />
<br />
There are tight rules for Conflict-of-Interest and those who are conflicted have to leave the room during the discussions on those papers.<br />
<br />
If you do get asked to serve on a panel, you should definitely do so. You get to see how the process works and help influence funding and research directions in your field. You can't reveal when you serve on a particular panel but you can say "Served on NSF Panels" on your CV.<br />
<br />
Panels tend to take proposals that will likely make progress and not take ones less risky. Funding risky proposals is specifically mentioned to the panel but when push comes to shove and there is less funding than worthy proposals, panelists gravitate towards proposals that don't take chances.<br />
<br />
Panels are not unlike conference program committees. It didn't always work this way, it used to be more like journal publications. I remember when the program director would send out proposals for outside reviews and then make funding decisions. That gave the program director more discretion to fund a wider variety of proposals.<br />
<br />
The NSF budget for computing goes up slowly while the number of academic computer scientists grows at a much larger clip. Until this changes, we'll have more and more worthy proposals unfunded, particularly proposals of bold risky projects. That's the saddest part of all.Lance Fortnowhttp://www.blogger.com/profile/06752030912874378610noreply@blogger.com0tag:blogger.com,1999:blog-3722233.post-32475840177410877762019-05-27T11:12:00.000-04:002019-05-27T17:53:18.254-04:00separating fact from fiction with the 56% of Americans say Arabic Numerals should not be taught in school<br />
On the excellent TV show Veep there was a subplot about a political candidate (who himself had failed algebra in HS) objecting to Algebra since it was invented by the Muslims. I don't recall the exact line, but he said something like `Math teachers are terrorists'<br />
This was, of course, fiction.<br />
<br />
The same week I read that 56% of survey respondents say `<u><i>Arabic Numerals' shouldn't be taught in</i></u> <i><u>schools'</u></i> Obviously also a fiction. Perhaps a headline from <i>The Onion</i>.<br />
<br />
No. The story is true.<br />
<br />
See snopes entry on this: <a href="https://www.snopes.com/fact-check/teaching-arabic-numerals/">here</a><br />
<br />
but also see many FALSE but FUNNY websites:<br />
<br />
Sarah Palin wants Arabic Numerals out of the schools: <a href="http://nationalreport.net/sarah-palin-wants-arabic-numerals-banned-americas-schools/">here</a> Funny but false.<br />
<br />
Jerry Brown is forcing students in California to learn Arabic Numerals as part of multi-culturism False by funny: <a href="https://me.me/i/sharia-law-must-be-stopped-under-gov-brown-students-in-20990368">here</a><br />
<br />
A website urging us to use Roman Numerals (which Jesus used!) False but funny: <a href="http://freedomnumerals.com/">here</a><br />
<br />
OKAY, what to make of the truth that really, really, 56% of Americans are against Arab Numerals<br />
<br />
1) Bigotry combined with ignorance.<br />
<br />
2) Some of the articles I read about this say its a problem with polls and people. There may be some of that, but still worries me.<br />
<br />
3) In Nazi Germany (WOW- Goodwin's law popped up rather early!) they stopped teaching relativity because Albert Einstein was Jewish (the story is more complicated than that, see <a href="https://www.scientificamerican.com/article/how-2-pro-nazi-nobelists-attacked-einstein-s-jewish-science-excerpt1/">her</a>e). That could of course never happen in America now (or could it, see <a href="https://www.tabletmag.com/jewish-news-and-politics/50097/time-warp">here</a> and <a href="https://www.conservapedia.com/index.php?title=Counterexamples_to_Relativity">here</a>).<br />
<br />
4) There is no danger that we will dump Arabic Numerals. I wonder if we will change there name to Freedom Numerals.<br />
<br />
5) Ignorance of science is a more immediate problem with the anti-vax people. See <a href="https://www.thedailybeast.com/measles-outbreak-grows-with-60-new-cases-across-26-states?ref=home">here</a><br />
<br />
<br />GASARCHhttp://www.blogger.com/profile/03615736448441925334noreply@blogger.com4tag:blogger.com,1999:blog-3722233.post-49828211510128146322019-05-24T09:14:00.000-04:002019-05-24T09:14:32.052-04:00Logic Then and NowThis week I attended the <a href="https://asl2019.commons.gc.cuny.edu/">Association of Symbolic Logic North American Annual Meeting</a> in New York City, giving a talk on P v NP.<br />
<br />
First I must share the announcement that ASL member Tuna Antinel of Lyon 1 University has been arrested in Turkey for his political beliefs. <a href="http://math.univ-lyon1.fr/SoutienTunaAltinel/">This website</a> (<a href="https://webusers.imj-prg.fr/~adrien.deloro/">English version</a>) has details and how to show your support.<br />
<br />
I last attended the ASL annual meeting at Notre Dame in 1993 as a young assistant professor. Back then I talked about <a href="https://doi.org/10.1137/S0097539793248305">then recent work</a> using a special kind of generic oracle to make the Berman-Hartmanis isomorphism conjecture true. I remember someone coming up to me after the talk saying how excited they were to see such applications of logic. I'm not a theoretical computer scientist, I'm a applied logician.<br />
<br />
I asked at my talk this year and maybe 2-3 people were at that 1993 meeting. The attendance seemed smaller and younger, though that could be my memory playing tricks. I heard that the 2018 meeting in Macomb, Illinois drew a larger crowd. New York is expensive and logicians don't get large travel budgets.<br />
<br />
Logic like theoretical computer science has gotten more specialized so I was playing catch up trying to follow many of the talks. Mariya Soskova of Wisconsin talked about enumeration degrees that brought me back to the days I sat in logic classes and talks at the University of Chicago. A set A is enumeration reducible to B if from an enumeration of B you can compute an enumeration of A and Mariya gave a great overview of this area.<br />
<br />
I learned about the status of an open problem for Turing reducibility: Is there a non-trivial automorphism of the Turing Degrees? A degree is the equivalence class where each class are the languages all computably Turing-reducible to each other. So the question asks if there is a bijection f mapping degrees to degrees, other than identity, that preserves reducibility or lack thereof.<br />
<br />
Here's what's known: There are countably many such automorphisms. There is a definable degree C in the arithmetic hierarchy, such that if f(C) = C then f is the identity. Also if f is the identity on all the c.e.-degrees (those equivalence classes containing a computably enumerable set), then f is the identity on all the degrees. Still open if there is more than one automorphism.<br />
<br />
<br />Lance Fortnowhttp://www.blogger.com/profile/06752030912874378610noreply@blogger.com0tag:blogger.com,1999:blog-3722233.post-62827810012711633422019-05-20T10:14:00.000-04:002019-05-20T10:14:14.118-04:00Notorious L.A.H or Notorious LAH? OR You always need one more proofreadI noticed a while back that even on the nth proofread of a document there are still corrections. So I decided to keep track of how many corrections there are in a paper I was working on. I chose a non-technical paper so that errors-in-the-math would not be the issue. I chose<br />
<br />
Guest Column: The Third P =?NP Poll (see <a href="https://blog.computationalcomplexity.org/2019/03/third-poll-on-p-vs-np-and-related.html">here</a>)<br />
<br />
that appeared in Lane Hemaspaandra's SIGACT News Complexity Column.<br />
<br />
I kept track of the following:<br />
<br />
1) Number of corrections. Anything that I changed. Could be style, a new thought, need not be (though could be) an error.<br />
<br />
2) Errors. These are things that really need to be corrected, like having `think' instead of `thing' .<br />
<br />
Corrections vs Errors, an Example:<br />
<br />
If I refer to Lane Hemaspaandra as <i>Notorious L.A.N</i> that is a correction and an error, as he is Notorous <i>L.A.H.</i><br />
<br />
If I refer to Lane Hemaspaandra as<i> Notorious L.A.H</i> and decide to change it to <i>LAH </i>that is a correction that is not an error.<br />
<br />
I didn't keep track of serious errors vs typos, but after the first 3 proofreads there were no more serious errors--- sort of- --you'll see. Most serious was a f<b>onts-gone-wild thing where half the paper was in boldface.</b><br />
<br />
Here is a history of the number of corrections<br />
<br />
1) Lane proofread the first draft. κ corrections where κ is some cardinal between the cardinality of N and the cardinality of 2<sup>N</sup> . Its value depends on which model of set theory you are in. (My spellchecker thinks that cardinality is not a word. I checked and I am spelling it correctly but perhaps it's one of those things where I stare at it too much and keep misreading it.)<br />
<br />
Henceforth I omit the word <i>proofread</i> as it is understood<br />
<br />
<br />
2) Bill G: 81 corrections, 29 of which were errors.<br />
<br />
3) Clyde: 64 corrections, of which 17 were errors.<br />
<br />
4) Bill G: 40 corrections, of which 21 were errors (I had added a new section causing more errors)<br />
<br />
5) Clyde: 30 corrections of which 10 were errors.<br />
<br />
6) Bill G: 24 corrections of which 6 were errors.<br />
<br />
7) Clyde: 18 corrections of which 8 were errors.<br />
<br />
8) David Sekora (A CS grad student at Maryland who at one time wanted to be an English Major): f15 corrections of which 15 were errors. Really! Typos dagnabbit! (Spell check thinks that dagnabbit is spelled wrong. Um---in that case what is the correct spelling?)<br />
<br />
9) Nathan Grammel (A CS grad student at Maryland) :6 corrections of which 3 were errors.<br />
<br />
10) Bill G, proofreading backwards, a paragraph at a time: 29 corrections of which 5 were errors.<br />
<br />
11) Justin Hontz, an ugrad who TAs for me: 10 corrections of which 7 were errors.<br />
<br />
12) Karthik Abinav, a grad student in theory at Maryland: 2 corrections both of which were errors. Was this the end or are there still issues?<br />
<br />
13) Josh Twitty, an ugrad who TAs for me: 0 corrections. YEAH!<br />
<br />
14) Dan Smolyak, an ugrad CS and Eco major:4 corrections, all 4 errors. <i>Error </i>sounds too strong. For example, one of them was to replace ?. with ? Yes, its an error, but not that important. It DOES point to his carefulness as a proofreader.<br />
<br />
15) Clyde Kruskal :20 corrections, 10 of which were errors. To call them errors seems wrong when he corrects <i>Group theory' </i>to <i>Group Theory</i>. None of these corrections were caused by prior comments. I think all of the errors were in the paper early on, undetected until now!<br />
<br />
16) Backwards Bill G again: 28 corrections, 14 of which were errors. Again, the errors were minor. Most of the errors were relatively recent. As an example, if I list out topics in math like:<br />
<br />
a) Group Theory, Set Theory, and Ramsey Theory<br />
<br />
then I am supposed to use capital letters, but if I say in prose<br />
<br />
Lance Fortnow thinks that the techniques used will be group theory, set theory, and Ramsey theory<br />
<br />
then only the R in Ramsey Theory is in caps. Makes me glad I'm in math.<br />
<br />
17) Lane got penultimate proofread. Lane found 75 (yes 75 WOW) of which 66 (yes 66 WOW) were errors. Many of these were spacing and latex things that I would never have noticed (indeed- I didn't notice) and most readers would not have noticed (hmmm- how do I know that?) but only an editor could catch (hmmm- when I've edited the book review column and now the open problems column and I never found more than 10 errors). So when all is said and done: KUDOS to Lane! And My point was that you can never get all the errors out. On that I am correct. I wonder if there are still errors? Yeah, but at most 10. However, I said that BEFORE giving it to Lane.<br />
<br />
18) Stephen Fenner, the editor of SIGACT news got FINAL proofread. He found that I spelled his name wrong . How many errors are left? I would bet at most 10. I would bet that I would lose that bet.<br />
------------------------------------------------------------------------------------------------------------<br />
<br />
Why after multiple proofreadings are there still errors? (My spell check thinks proofreadings is not a word. Maybe my spell check is worried that if people get documents proofread a lot then they won't be needed anymore. This blog post refutes that thought.)<br />
<br />
1) An error can occur from a correction. This caused a massive problem with another paper. Lane's next column will be by me and co-authors on The Muffin Problem. We had all kinds of problems with the colors and sizes--- Massive Magenta Muffins or Miniature Magenta Muffins? Sizes gone wild! Again Kudos to my proofreaders and to Lane for catching this rather important error.<br />
<br />
2) If some passage is added late in the process it will surely have errors.<br />
<br />
3) An error correction may clear away the brush so you can see other errors.<br />
<br />
4) With LaTeX (or Word for some) we have the ability to get things perfect. So there is no cost to keeping on perfecting things. This lead so many corrections that are not errors.<br />
<br />
5) I know of an adviser who would first say change A to B, and later change B back to A. (None of that happened with the paper discussed above).<br />
<br />
Are errors inevitable? Clyde Kruskal tells me that his father Martin Kruskal, as a teenager, read Courant and Robbins book <i>What is Mathematics</i> and found some errors in it. Martin's mother didn't believe him and marched him over to Courant's house:<br />
<br />
MARTIN MOTHER: Martin claims to have found errors in your book.<br />
<br />
COURANT: (laughs) There are errors in every book.<br />
<br />
Courant was so impressed that ten (or so) years later Courant became Martin's PhD adviser.<br />
<br />
<br />GASARCHhttp://www.blogger.com/profile/03615736448441925334noreply@blogger.com0tag:blogger.com,1999:blog-3722233.post-91757876836016033342019-05-16T08:46:00.000-04:002019-05-16T08:46:33.928-04:00Getting Through the ClutterMy daughter showed up at her doctor's office the other day and found it closed. She complained that she had received all these alerts, texts, emails, voicemails, reminding her of the appointment and then they weren't there when she showed up. She had stopped reading the alerts, the last of which said the appointment need to be rescheduled.<br />
<br />
We all get too many alerts. I just assume many of the emails I send to faculty never get read or remembered. I get many requests to mention conferences, workshop and other theory happenings on this blog because nobody knows how to get the word out through the clutter. If we followed through on all these requests, this blog would become clutter itself.<br />
<br />
Back in 2009, Nikhil Devanur and I wrote a <a href="https://doi.org/10.1145/1562814.1562830">paper</a> trying to capture this phenomenon using complexity. Building on Levin's notion of universal search, the unawareness of a string x in an environment E is the amount of time needed to generate x from a context c given an oracle for E. Levin showed that one can have a universal algorithm, only a constant time slower to generate x than any other algorithm. One should think of E as the sum total of all our knowledge including search engines on the Internet. Technically we should have used the term "attention" instead of "awareness".<br />
<br />
One example is using a calendar as part of your environment, E, that reminds you of an event, x, on that date, c. We use calendars, contact lists, emails searches and many other ways to keep strings we need to remember. Advertisers try to alter your E to get the unawareness of x down.<br />
<br />
One of these papers that didn't go far because we didn't have great applications for the definition. But it follows a good philosophy, when life seems complex, model it.Lance Fortnowhttp://www.blogger.com/profile/06752030912874378610noreply@blogger.com1tag:blogger.com,1999:blog-3722233.post-35071105033220107082019-05-13T00:39:00.000-04:002019-05-15T14:01:34.489-04:00Ronald Graham's other large number. Well---- it was large in 1964 anyway.Graham's number (see <a href="https://en.wikipedia.org/wiki/Graham%27s_number">here</a>) was at one time the largest number to appear in a math proof.<br />
<br />
a) GN was an upper bound on a problem in Ramsey theory. There are now better upper bounds, see <a href="https://www.sciencedirect.com/science/article/pii/S0195669814000936?via%3Dihub">here</a>. These better upper bounds are still large- Hales-Jewitt-Large, but that's already much smaller than the original GN.<br />
<br />
b) Other proofs now have numbers even larger than GN. For example Harvey Friedman's work on the finite versions of Kruskal's Tree Theorem. (There may be other cases- if you know some then let me know in the comments.)<br />
<br />
Since my dept recently moved buildings I found old papers that I had not looked at in years. One of them was<br />
<br />
<i>Old and New Problems and Results in Combinatorial Number Theory</i><br />
<br />
by Erdos and Graham<br />
<br />
(see <a href="http://www.math.ucsd.edu/~ronspubs/79_09_combinatorial_number_theory.pdf">here</a>)<br />
<br />
So I began reading it and came across a result of Graham from 1964 that used large numbers. No where near as large as GN, but I found it interesting that Graham was involved with large numbers way back then.<br />
<br />
Here is the problem:<br />
<br />
A <i>Lucas Sequence</i> is a sequence that obeys<br />
<br />
a(n) = a(n-1) + a(n-2).<br />
<br />
Clearly such a sequence is determined by a(0) and a(1).<br />
<br />
QUESTION: Does there exists a(0) and a(1) that are rel prime such that the sequence has only composite numbers?<br />
<br />
By ingenuity and some computing power Graham found YES. For how the got the numbers see <a href="http://www.math.ucsd.edu/~ronspubs/64_06_fibonacci.pdf">here</a>. The numbers are of course in the paper, and how they got them is interesting, but I present them anyway. Hope I don't make a typo:<br />
<br />
a(0) = 1786772701928802632268715130455793<br />
<br />
a(1) = 1059683225053915111058164141686995<br />
<br />
The paper Old and New... says its open if there is a smaller pair of numbers, I do not know if it is still open. If you know, let us all know in the comments!<br />
<br />
These numbers seem small today since we have modern computers that can store and manipulate them easily. Were the considered large numbers in 1964? They were never called Graham Numbers which is probably just as well since that honor lay ahead.<br />
<br />
<br />GASARCHhttp://www.blogger.com/profile/03615736448441925334noreply@blogger.com5tag:blogger.com,1999:blog-3722233.post-7224191764010697442019-05-09T08:31:00.000-04:002019-05-09T08:31:57.559-04:00Multiple ProversJust over thirty years ago on May 5, 1989, I defended my PhD Thesis <a href="https://lance.fortnow.com/papers/files/thesis.pdf">Complexity-Theoretic Aspects of Interactive Proof Systems</a>. It's starts off with a parable for interactive proof systems.<br />
<blockquote class="tr_bq">
Victor, a venture capitalist, had everything a man could desire: money, women and power.
But he felt something missing. He decided he lacked knowledge. So Victor packed up his
bags and headed to the Himalayas in search of ultimate truths.
The natives pointed Victor to a tall mountain and mentioned rumors of a great man full of
wisdom. Victor, who smartly brought some climbing equipment, tackled the mountain until
he reached a small cave near the summit. Victor found the great Pulu, grand guru of all that
is known. Victor inquired to some ultimate truths and Pulu responded,
<i>I will teach you but you must not trust my words</i>.
Victor agreed and found he learned much even though he had to verify all the sayings
of the great Pulu. Victor though lacked complete happiness and he asked if he could learn
knowledge beyond what he could learn in this manner. The grand guru replied,
<i>You may ask and I will answer</i>.
Victor pondered this idea for a minute and said, "Since you know all that is known, why can you not predict my questions?" A silence reigned over the mountain for a short while until the guru finally spoke,
<i>You must use other implements, symbols of your past life</i>.
Victor thought for a while and reached into his backpack and brought out some spare
change he had unwittingly carried with him. Even the great Pulu can not predict the flip of
a coin. He started flipping the coins to ask the guru and wondered what can I learn now?</blockquote>
Without the coins, one gets the complexity class NP. My thesis didn't answer the last question, but by the end of the year, <a href="https://doi.org/10.1109/FSCS.1990.89519">Shamir</a> building on work of <a href="https://doi.org/10.1145/146585.146605">Lund, Fortnow, Karloff and Nisan</a> showed this class IP was equal to PSPACE, the problems we could solve in a polynomial amount of memory.<br />
<br />
Part of my thesis explored the class MIP where we had multiple Pulus (provers) on different mountain tops unable to communicate. The news was disappointing, we failed to get a PSPACE upper bound for MIP, only NEXP (nondeterministic exponential time) and our proof that two provers sufficed relied on a bad assumption on how errors get reduced when you run multiple protocols in parallel. Later Babai, Lund and myself showed <a href="http://doi.org/10.1007/BF01200056">MIP = NEXP</a> and Ran Raz <a href="https://doi.org/10.1137/S0097539795280895">showed</a> parallel repetition does reduce the error sufficiently.<br />
<br />
Back in the 80's we didn't even imagine the possibility that the Pulus had shared entangled quantum bits. Does the entanglement allow the provers to cheat or can the entanglement allow them to prove more things? Turns out to be much more, as a <a href="https://arxiv.org/abs/1904.05870">new result</a> by Anand Natarajan and John Wright shows that MIP*, MIP with classical communication, classical verifier and two provers with previously entangled quantum bits, can compute everything in NEEXP, nondeterministic double exponential time. This is only a lower bound for MIP*, possibly one can do even more.<br />
<br />
Neat to see my three-decade old thesis explored ideas that people are still thinking about today.Lance Fortnowhttp://www.blogger.com/profile/06752030912874378610noreply@blogger.com0tag:blogger.com,1999:blog-3722233.post-24314694562470885232019-05-06T20:41:00.000-04:002019-05-06T20:41:19.956-04:00Thoughts on the recent Jeopardy streak (SPOILERS)James Holzhauer has won 22 consecutive games of Jeopardy and has made around 1.6 million dollars. Nice work if you can get it. Here are some thoughts no this<br />
<br />
1) Before James H the records for number of consecutive games was, and still is, Ken Jennings winning 74 in a row, and second place was 20. I was surprised that Ken was that much better than the competition.<br />
<br />
2) Before James H the record for amount of money in normal play (not extra from, say, tournament of champions or losing to a computer) was around 400,000. I was surprised that Ken was that much better than the competition.<br />
<br />
3) James is obliterating the records for most wins in a single game. He holds the top 12 records for this. This is due to his betting A LOT on the daily doubles and the final jeop, as well as of course answering so many questions right.<br />
<br />
4) One reason players in Jeopardy don't have long streaks is fatigue. The actually play<br />
5 games a day, two days of the week. James H is getting a break since he has two weeks off now since they will soon have the Teachers Tournament. This could work either way--- he gets a break or he loses being in-the-zone.<br />
<br />
5) James strategy is:<br />
<br />
a) Begin with the harder (and more lucrative) questions.<br />
<br />
b) Bet A LOT on the daily doubles (which are more likely to be in the more lucrative questions) and almost always go into final jeop with more than twice your opponent (He failed to do this only once.)<br />
<br />
c) Bet A LOT on Final Jeop- though not enough so that if you lose you lose the game. I think he's gotten every Final Jeop question right.<br />
<br />
For more on his strategy see this article by Oliver Roeder in Nate Silvers Blog: <a href="https://fivethirtyeight.com/features/the-man-who-solved-jeopardy/">here</a><br />
<br />
6) I tend to think of this as being a high-risk, high-reward strategy and thus it is unlikely he will beat Ken Jennings, but every time he wins that thought seems sillier and sillier. While we are here, how likely is it that someone will beat Ken Jennings? In an article before all of this Ben Morrison in Nate Silvers Blog wrote that it was quite likely SOMEONE would break Ken J's record, see <a href="https://fivethirtyeight.com/features/ken-jennings-has-nothing-on-joe-dimaggio/">here</a>.<br />
<br />
7) OKAY, how does James H compare to Ken J? According to Oliver Roeder in Nate Silvers Blog,<br />
<a href="https://fivethirtyeight.com/features/the-battle-for-jeopardy-supremacy/">here</a>, they are similar in terms of percent of questions answered right, but James H bets so much more (bets better?) which is why he is getting so much money. I'll be curious to see a head-to-head contest at some point. But to the issue at hand, they don't give James H that good a chance to break Ken J's record.<br />
<br />
8) Jeop used to have a 5-game limit. Maybe that was a good idea- its not that interesting seeing the same person with the same strategy win 22 in a row. Also, the short-talk-with-Alex T-- James is running out of interesting things to say. I wonder what Alex did with Ken J after 50 games.<br />
``So Ken, I hear you're good at Jeopardy''<br />
<br />
9) Misc: Ken J was the inspiration for IBM to do Watson.<br />
<br />
10) Will future players use James Strategy? Note that you have to be REALLY GOOD in the first place for it to help you. Maybe a modified version where you go for the lucrative questions and bet a lot on Daily Doubles (more than people have done in the past) when its an area you know really well (I'll take Ramsey Theory for $2000.)<br />
<br />
11) I used to DVR and watch Jeop but didn't mind if I was a few behind. Now I have to stay on top of it so articles like those pointed to above don't give me a spoiler.<br />
<br />
12) My prediction: He will beat Ken Jenning for money but not for number-of-games. I have no real confidence in these predictions.GASARCHhttp://www.blogger.com/profile/03615736448441925334noreply@blogger.com2tag:blogger.com,1999:blog-3722233.post-32049536980074938952019-05-02T08:20:00.001-04:002019-05-02T08:20:52.726-04:00The Next Chapter<div class="separator" style="clear: both; text-align: center;">
<a href="https://4.bp.blogspot.com/-R3cQu_-p5K8/XMhzxr-ZDrI/AAAAAAABnYQ/4tXefV5yICMHnD_U4g8QmFFftzHzeOWTQCLcBGAs/s1600/COS_stacked_blk_red.jpg" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" data-original-height="478" data-original-width="1600" height="95" src="https://4.bp.blogspot.com/-R3cQu_-p5K8/XMhzxr-ZDrI/AAAAAAABnYQ/4tXefV5yICMHnD_U4g8QmFFftzHzeOWTQCLcBGAs/s320/COS_stacked_blk_red.jpg" width="320" /></a></div>
<div>
<br /></div>
I've <a href="https://news.iit.edu/stories/2019/05/lance-fortnow-designated-new-college-science-dean">accepted a position</a> as Dean of the <a href="https://science.iit.edu/">College of Science</a> at the Illinois Institute of Technology in Chicago starting in August. It's an exciting opportunity to really build up the sciences and computing in the city that I have spent the bulk of my academic career and grew to love.<br />
<div>
<br /></div>
<div>
I had a fantastic time at Georgia Tech over the last seven years working with an incredible faculty, staff and students in the School of Computer Science. This is a special place and I enjoyed watching the school, the institute and the City of Atlanta grow and evolve.<br />
<br />
After I <a href="https://twitter.com/fortnow/status/1123644799825907712">tweeted</a> the news yesterday, Bill Cook reminded me that<br />
<blockquote class="tr_bq">
Illinois Tech was the long-time home of Karl Menger, the first person to pose the problem of determining the complexity of the TSP. Now you can settle it!</blockquote>
I wouldn't bet on my settling the complexity of traveling salesman even if I didn't have a college to run. But it goes to remind us that wherever you go in life, P and NP will be right there waiting for you. </div>
Lance Fortnowhttp://www.blogger.com/profile/06752030912874378610noreply@blogger.com1tag:blogger.com,1999:blog-3722233.post-60258848555088930272019-04-28T22:26:00.000-04:002019-04-28T22:26:12.748-04:00 x3 + y3 + z3 = 33 has a solution in Z. And its big!Consider the following problem:<br />
<br />
Given k, a natural number, determine if there exists x,y,z INTEGERS such that x<sup>3</sup>+y<sup>3</sup>+z<sup>3</sup>=k.<br />
<br />
It is not obvious that this problem is decidable (I think it is but have not been able to find an exact statement to that affect; however, if it was not solvable, I would know that, hence it is solvable. If you know a ref give it in the comments.)<br />
<br />
<br />
If k≡ 4,5 mod 9 then mod arguments easily show there is no solution. <a href="https://arxiv.org/pdf/1604.07746.pdf">Huisman</a> showed that if k≤ 1000, k≡1,2,3,6,7,8 mod 9 and max(|x|,|y|,|z|) ≤ 10<sup>15</sup> and k is NOT one of<br />
<br />
33, 42, 114, 165, 390, 579, 627, 633, 732, 795, 906, 921, 975<br />
<br />
then there was a solution. For those on the list it was unknown.<br />
<br />
Recently <a href="https://people.maths.bris.ac.uk/~maarb/papers/cubesv1.pdf">Booker</a> (not Cory Booker, the candidate for prez, but Andrew Booker who I assume is a math-computer science person and is not running for prez) showed that<br />
<br />
x<sup>3</sup> + y<sup>3</sup> + z<sup>3</sup> =33<br />
<br />
DOES have a solution in INTEGERS. It is<br />
<br />
x= 8,866,128,975,287,528<br />
<br />
y=-8,778,405,442,862,239<br />
<br />
z=-2,736,111,468,807,040<br />
<br />
<br />
does that make us more likely or less likely to think that<br />
<br />
x<sup>3</sup> + y<sup>3</sup> + z<sup>3</sup> =42<br />
<br />
has a solution? How about =114, etc, the others on the list?<br />
<br />
Rather than say what I think is true (I have no idea) here is what I HOPE is true: that the resolution of these problems leads to some mathematics of interest.<br />
<br />
<br />
<br />
<br />
<br />GASARCHhttp://www.blogger.com/profile/03615736448441925334noreply@blogger.com4tag:blogger.com,1999:blog-3722233.post-80783533869668814512019-04-25T08:12:00.001-04:002019-04-25T08:13:14.850-04:00Geo-Centric ComplexityAn interesting discussion during Dagstuhl last month about the US-centric view of theory. Bad enough that all talks and papers in an international venue are in English but we also have<br />
<ul>
<li><a href="https://en.wiktionary.org/wiki/Manhattan_distance">Manhattan Distance</a>. How are foreigners supposed to know about the structure of streets in New York? What's wrong with grid distance?</li>
<li><a href="https://en.wikipedia.org/wiki/Las_Vegas_algorithm">Las Vegas Algorithms</a>. I found this one a little unfair, after all Monte Carlo algorithms came first. Still today might not Macau algorithms make sense?</li>
<li><a href="https://en.wikipedia.org/wiki/Arthur%E2%80%93Merlin_protocol">Arthur-Merlin Games</a>. A British reference by a Hungarian living in the US (László Babai who also coined Las Vegas algorithms). Still the Chinese might not know the fables. Glad the Europeans don't remember the <a href="https://blog.computationalcomplexity.org/2017/04/alice-and-bob-and-pat-and-vanna.html">Pat and Vanna</a> terminology I used in my first STOC talk. </li>
<li>Alice and Bob. The famous pair of cryptographers but how generically American can you get. Why not Amare and Bhati?</li>
</ul>
<div>
I have two minds here. We shouldn't alienate or confuse those who didn't grow up in an Anglo-American culture. On the other hand, I hate to have to try and make all terminology culturally neutral, you'd just end up with technical and ugly names, like P and NP.</div>
Lance Fortnowhttp://www.blogger.com/profile/06752030912874378610noreply@blogger.com13