tag:blogger.com,1999:blog-3722233Fri, 22 Sep 2023 07:16:00 +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)Blogger3039125tag:blogger.com,1999:blog-3722233.post-7999245293266803407Wed, 20 Sep 2023 20:42:00 +00002023-09-20T15:42:21.333-05:00We Must Be Doing Something Right<p>The Chicago Tribune ran an <a href="https://www.chicagotribune.com/opinion/editorials/ct-editorial-college-rankings-20230918-hksmm6n4qnarfhsb54ka2eetyi-story.html">editorial</a> Monday that started</p><p></p><blockquote><p>What’s the best four-year college in Illinois? Not the University of Chicago, Northwestern University or the University of Illinois at Urbana-Champaign.</p><p>No, the best college in the state is the Illinois Institute of Technology, of course!</p></blockquote><p>The editorial was referring to the Wall Street Journal that <a href="https://www.wsj.com/us-news/education/wsj-best-college-rankings-princeton-12c44c47">ranked</a> Illinois Tech 23rd in the nation, tops in Illinois, up from 117 last year. Illinois Tech also cracked the top 100 in the latest <a href="https://www.usnews.com/best-colleges">US News rankings</a>, up from 127. </p><p>Did we just get that much better? Yes, yes we did! </p><p>Or maybe it had to do with changes in methodology. The Wall Street Journal's rankings this year puts a heavy emphasis on "how much will it improve the salaries they earn after receiving their diplomas". As Illinois Tech caters to students who often are the first in their families to go to college, and focuses on technical degrees, we can really raise up students who might not have otherwise had such an education. It's one of the things that brought me to the university in the first place.</p><p><a href="https://www.usnews.com/education/best-colleges/articles/how-us-news-calculated-the-rankings">US News</a> also "increased the emphasis on how often schools' students from all socioeconomic backgrounds earned degrees and took advantage of information on graduate outcomes that was not available until recently". </p><p>All rankings should be taken with a grain of salt, and universities will always tout rankings where do they well while conveniently ignoring others. It's impossible to linearly order colleges--there are just too many different factors that make different schools better for different people. </p><p>But as people start to <a href="https://www.nytimes.com/2023/09/20/podcasts/the-daily/is-college-worth-it.html">question the value of college</a> the rankings are starting to address their concerns. And if that bumps up my university, so be it.</p>https://blog.computationalcomplexity.org/2023/09/we-must-be-doing-something-right.htmlnoreply@blogger.com (Lance Fortnow)0tag:blogger.com,1999:blog-3722233.post-3379766773900804590Sun, 17 Sep 2023 20:00:00 +00002023-09-17T15:00:43.537-05:00ACM to go paper-free! Good? Bad?The ACM (Association of Computing Machinery) will soon stop having print versions of most its publications. Rather than list which ones <i>are </i>going paper free, I list all those that <i>are not </i>going paper free:<div>Communications of the ACM</div><div>ACM Inroads</div><div>Interactions</div><div>XRDS: Crossroads</div><div><br /></div><div>What are the PROS and CONS of this? What are the PROS and CONS of any publication or book being paper free?</div><div><br /></div><div><br /></div><div>1) I like getting SIGACT News on paper since </div><div>a) It reminds me to read it</div><div>b) Reading on the screen is either on my phone which is awkward (especially for math) or my desktop (so I have to be AT my desktop). </div><div>I DO NOT think this is my inner-Luddite talking. </div><div> </div><div>2) QUESTION: Will SIGACT News and JACM and other ACM publications continue to have page limit for articles? When I was SIGACT News Book Rev Col editor, and now as Open Problems Col editor, I have often had to ask the editor <i>Can I have X pages this time? </i>The answer was always yes, so perhaps there never really was a page limit. But is having no page limit good? Not necessarily. Having a limit may force you to only write down the important parts. <br /></div><div><br /></div><div>3) PRO: Its good for the ecology to not make so much paper. While this is certainly true, I think the world needs to rethink our entire consumer society to really make a difference for the ecology. In fact, I wonder if e-cars, carbon-offsets, and paper free products make us feel good without really helping much.<br /></div><div><br /></div><div>4) CON but good timing: I recently had an open problems column with two co-authors. One of them is not in the ACM and is not in the community, but wanted to see a copy of the article. I have arranged to have a paper copy of that one issue sent to him. If I had published this column in 2024, I could not do this. And saying <i>Just go to link</i> <i>BLAH' </i>does not have the same impact as PAPER. I could have printed it out for him, but that just does not seem like the same as having an official copy. </div><div>I DO think this is my inner-Luddite talking. Or his. <br /></div><div><br /></div><div>5) For quite some time computer science conference proceedings have not been on paper (there have been a variety of ways this is done). Before that time the following happened a lot: I am in Dave Mounts office talking about something (e.g., who should teach what). He gets a phone call but motions that it will be short so I should still hang out. While hanging out I pick up a RANDOM proceedings of the conference RANDOM and find the one or two article in it about Ramsey Theory and read them, or at least note them and read them later. That kind of RANDOM knowledge SEEMS less common in a paper-free age. But maybe not. I HAVE clicked around the web and accidentally learned things. Like the facts I learned for my post on simulation theory <a href="https://blog.computationalcomplexity.org/2023/08/why-i-have-some-sympathy-for-simulation.html">here</a>.<br /></div><div><br /></div><div>6) Similar to point 5- I used to go to the math library and RANDOMLY look at a volume of the American Math Monthly or some other similar journal and look at some articles in it. But now that's harder since they have stopped getting journals on papers and only get them electronically. To be fair, paper versions of the journals are EXPENSIVE. </div><div><br /></div><div>7) In the year 1999 my grad student Evan Golub got his PhD and he had to bring a PAPER copy of it to some office where they measured margins and stuff of EVERY PAGE to make sure it was within university specs. Why? Because in an earlier era this was important for when the thesis was put on microfilm. Were they doing that in 1999? I doubt it. Some of my younger readers are thinking <i>OH, they didn't have LaTeX packages that take care of</i> <i>margin</i>s <i>for you.</i> <i> </i>Actually they DID have such packages but, to be fair, the requirement that the university literally measures margins on EVERY PAGE was <i>completely</i> idiotic. I am happy to say that in 2007 when my student Carl Anderson got his PhD nobody needed a paper version. I do not know when the rules changed but I am glad they did. </div><div><br /></div><div>8) The ACM should promote this <i>paper free</i> change by doing a rap song like Progressive Insurance did <a href="https://www.youtube.com/watch?v=XtSGryJDYO4">here</a>. </div><div><br /></div><div>9) Recently I had a paper with 3 co-authors that all three of us, and some others, proofread (I thought) very carefully. The referee accepted it but with a somewhat nebulous <i>this paper needs a better proofreading. </i>I then PRINTED IT OUT and read it AWAY FROM MY COMPUTER (the paper is on overleaf) with a RED PEN and I found LOTS of stuff to fix that we all missed before. So there are some advantages to getting OFF of the computer, though that may require PRINTING. (I also blogged about this topic <a href="https://blog.computationalcomplexity.org/search?q=Columbo">here</a>.) </div>https://blog.computationalcomplexity.org/2023/09/acm-to-go-paper-free-good-bad.htmlnoreply@blogger.com (gasarch)10tag:blogger.com,1999:blog-3722233.post-6561442354298865170Thu, 14 Sep 2023 13:25:00 +00002023-09-14T08:51:49.728-05:00Mr. Jaeger and The Scroll<div>There were three major influencers in my educational journey: Mike Sipser, my PhD advisor at Berkeley and MIT, Juris Hartmanis who founded the field of computational complexity and led me to it at Cornell, and Philip Jaeger, a math teacher at Millburn High School in New Jersey.</div><div><br /></div><table align="center" cellpadding="0" cellspacing="0" class="tr-caption-container" style="margin-left: auto; margin-right: auto;"><tbody><tr><td style="text-align: center;"><a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhllaSItEff4LtPoFSxc8ESvi2fu5HfIZPz6UgQl7AVxw59pSVS-eB1W6-MxcF3_h66Hj4_b5uH2MzERBmF8ZOLgytuOOylYQ4UWPMMYRdwLLWo5tzfvlEZ4J46X4748QqSplwSlok1OcMLKm5AB-u11GEh1pYONKXd_yjH3H03Yqk4ludO2p9b/s3500/1694551927566-52f1a15b-0645-4bad-9dfa-0652aebb5b29_.jpg" style="margin-left: auto; margin-right: auto;"><img alt="Mr. Jaeger" border="0" data-original-height="3500" data-original-width="2044" height="400" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhllaSItEff4LtPoFSxc8ESvi2fu5HfIZPz6UgQl7AVxw59pSVS-eB1W6-MxcF3_h66Hj4_b5uH2MzERBmF8ZOLgytuOOylYQ4UWPMMYRdwLLWo5tzfvlEZ4J46X4748QqSplwSlok1OcMLKm5AB-u11GEh1pYONKXd_yjH3H03Yqk4ludO2p9b/w234-h400/1694551927566-52f1a15b-0645-4bad-9dfa-0652aebb5b29_.jpg" width="234" /></a></td></tr><tr><td class="tr-caption" style="text-align: center;"><i>Perhaps your "scroll" will outlast both of us.</i></td></tr></tbody></table><p>I took two math courses with Philip Jaeger, Algebra II and Probability. Mr. Jaeger (I still can't call him Phil) also ran the computer room, a narrow room of three teletype machines where we saved programs on paper tape, where we would do <a href="https://blog.computationalcomplexity.org/2005/07/computer-science-in-high-school.html">simulations of poker hands</a> for probability class among various other programming. He truly set me up for my future career. </p><p>Mr. Jaeger was also the advisor of the computer club when I was president. </p><div><table align="center" cellpadding="0" cellspacing="0" class="tr-caption-container" style="margin-left: auto; margin-right: auto;"><tbody><tr><td style="text-align: center;"><a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEj31TvIUZ8uMe4vVUpq2JyWOxHyqE_ek4jYPVD5PQZ-RZueBTXm7lb184DbD4vwmj0P9euTIZk97wyOfyW2oSBr_06TwTD79bqbqwP5LWVBahgqu3BxzIKfS6lp-M7IPXiTtvlcsVSF7xWDy-fc53NADOhwIHCFTVr3wva2-tnZum9vfrLg_woP/s3500/1694551809048-36b3aadc-89df-4ad6-8087-8575facde165_.jpg" style="margin-left: auto; margin-right: auto;"><img border="0" data-original-height="3500" data-original-width="1935" height="320" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEj31TvIUZ8uMe4vVUpq2JyWOxHyqE_ek4jYPVD5PQZ-RZueBTXm7lb184DbD4vwmj0P9euTIZk97wyOfyW2oSBr_06TwTD79bqbqwP5LWVBahgqu3BxzIKfS6lp-M7IPXiTtvlcsVSF7xWDy-fc53NADOhwIHCFTVr3wva2-tnZum9vfrLg_woP/s320/1694551809048-36b3aadc-89df-4ad6-8087-8575facde165_.jpg" width="177" /></a></td></tr><tr><td class="tr-caption" style="text-align: center;">That's me in the middle of the first photo, with Mr. Jaeger on my right.<br /></td></tr></tbody></table><br /></div><div>Sometime during my high school years I took one of the rolls used in the teletype machine and wrote down a lengthy formula. According to Mr. Jaeger, the formula is for the area of a random triangle. I'm sure it made sense to me in high school.</div><div><br /><table 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://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEi_vgluRF_Nwdkf6W25N7ZyRgXcS49ae1_7DhyTUKKIeF4DQxiXDMYsl8gvw6Cg8exzUcJPfqzyBGE4Xms59oXAyrPNCScvasJcnA-X7GiguSWYJCARXAQ4Jw6_HrXUbkAQVz3nUS8BgMN10bNffRoMmGZmOjp-2MLIQ1P6uWEPlH-uQ8h-nvRb/s1280/Scroll.jpg" style="clear: right; margin-bottom: 1em; margin-left: auto; margin-right: auto;"><img border="0" data-original-height="1280" data-original-width="960" height="400" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEi_vgluRF_Nwdkf6W25N7ZyRgXcS49ae1_7DhyTUKKIeF4DQxiXDMYsl8gvw6Cg8exzUcJPfqzyBGE4Xms59oXAyrPNCScvasJcnA-X7GiguSWYJCARXAQ4Jw6_HrXUbkAQVz3nUS8BgMN10bNffRoMmGZmOjp-2MLIQ1P6uWEPlH-uQ8h-nvRb/w300-h400/Scroll.jpg" width="300" /></a></td></tr><tr><td class="tr-caption" style="text-align: center;">The Scroll</td></tr></tbody></table></div><div><br /></div><div><br /></div><div><table align="center" cellpadding="0" cellspacing="0" class="tr-caption-container" style="margin-left: auto; margin-right: auto;"><tbody><tr><td style="text-align: center;"><a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhEld2WAEBucxx79zVlS9doDUcKxgJGDcZFZPyU8JngaH6573ujo9vI_dJY_rBDG3CRPnm_Pe-KQvyH-0qKTOVGHZlYb1OEJHb9NTOxwDRCrAWEHeVJwSRvji6v5tSSiGDjtMtql8hFsXY89MRIGvaQF92d5jQKfpEjxvnP-DuPeO3m15hTl81s/s1280/unrolled.jpg" style="clear: right; margin-bottom: 1em; margin-left: auto; margin-right: auto;"><img border="0" data-original-height="554" data-original-width="1280" height="174" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhEld2WAEBucxx79zVlS9doDUcKxgJGDcZFZPyU8JngaH6573ujo9vI_dJY_rBDG3CRPnm_Pe-KQvyH-0qKTOVGHZlYb1OEJHb9NTOxwDRCrAWEHeVJwSRvji6v5tSSiGDjtMtql8hFsXY89MRIGvaQF92d5jQKfpEjxvnP-DuPeO3m15hTl81s/w400-h174/unrolled.jpg" width="400" /></a></td></tr><tr><td class="tr-caption" style="text-align: center;">The Scroll partially unscrolled</td></tr></tbody></table><br /></div><div>Another student Cheryl took the entire formula and put it entirely on an index card. Mr. Jaeger saved both the roll and the card.</div><div><br /><table align="center" cellpadding="0" cellspacing="0" class="tr-caption-container" style="margin-left: auto; margin-right: auto;"><tbody><tr><td style="text-align: center;"><a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEj1D6jcP-Xd9yau2_0EjVgJ4SD1Ljq6GD90OsY6xvlKSkipBaB0CsXBbaVca51aPFvV-DLbD1Pqe3vI9KnFaZwsA2dtsA_AWtDskbIqxDsno3weZonrTXUZyEsU6MNKI2TulKzQmfRArLWOvxEOvfhY06Oi_7BqBuNzaMTQcMNGvz84qHaxgW5r/s1280/card.jpg" style="margin-left: auto; margin-right: auto;"><img border="0" data-original-height="781" data-original-width="1280" height="244" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEj1D6jcP-Xd9yau2_0EjVgJ4SD1Ljq6GD90OsY6xvlKSkipBaB0CsXBbaVca51aPFvV-DLbD1Pqe3vI9KnFaZwsA2dtsA_AWtDskbIqxDsno3weZonrTXUZyEsU6MNKI2TulKzQmfRArLWOvxEOvfhY06Oi_7BqBuNzaMTQcMNGvz84qHaxgW5r/w400-h244/card.jpg" width="400" /></a></td></tr><tr><td class="tr-caption" style="text-align: center;">The index card (actual size is 3x5 in)</td></tr></tbody></table></div><div><br /></div><div>Fast forward to 2023. Mr. Jaeger finds the roll and the card. His son, <a href="https://en.wikipedia.org/wiki/David_A._Jaeger">an academic in his own right</a>, suggested that they track Cheryl and me down. I'm not hard to find. After some emails, they invited me to visit to pick up the roll. Last weekend I was in New Jersey visiting family so I did just that.</div><div><br /></div><div>What great fun to talk to my old teacher, reminiscing about the high school people and times, and catching up after four decades. It was Mr. Jaeger who showed me the computer dating form that had me <a href="https://blog.computationalcomplexity.org/2014/06/computer-dating.html">create a version</a> for our high school.</div><div><br /></div><div>I gave Mr. Jaeger a copy of my book and he gave me the scroll and the index card. (Cheryl, now a lawyer, wasn't interested in it). I safely brought it all home to Chicago along with all the memories. I dug up my old yearbook for first two photos above. The scroll will indeed outlast the both of us.</div><div><br /><table align="center" cellpadding="0" cellspacing="0" class="tr-caption-container" style="margin-left: auto; margin-right: auto;"><tbody><tr><td style="text-align: center;"><a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhPNMAL17foWE1S1ku7LVNd2zXoFDV2LEn_CFUNX2caNLFukTAoLvtPcAHQAqXhHMHf9UF__4L5rTN5c3fTPAxDaklKkrNG6IQiva_0SsmD7dDkmPMgbbM0guI41ahrtSq6aUCodRF3ICdX5reZRzVIZ4PkHmOGZzRzQ4sDQ3yxJCJOGDpoBsYa/s4080/PXL_20230909_195523488.jpg" style="margin-left: auto; margin-right: auto;"><img border="0" data-original-height="4080" data-original-width="3072" height="320" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhPNMAL17foWE1S1ku7LVNd2zXoFDV2LEn_CFUNX2caNLFukTAoLvtPcAHQAqXhHMHf9UF__4L5rTN5c3fTPAxDaklKkrNG6IQiva_0SsmD7dDkmPMgbbM0guI41ahrtSq6aUCodRF3ICdX5reZRzVIZ4PkHmOGZzRzQ4sDQ3yxJCJOGDpoBsYa/s320/PXL_20230909_195523488.jpg" width="241" /></a></td></tr><tr><td class="tr-caption" style="text-align: center;">Mr. Jaeger, myself and the scroll.</td></tr></tbody></table></div><p></p>https://blog.computationalcomplexity.org/2023/09/mr-jaeger-and-scroll.htmlnoreply@blogger.com (Lance Fortnow)3tag:blogger.com,1999:blog-3722233.post-8022216438319852411Sun, 10 Sep 2023 19:31:00 +00002023-09-10T14:31:08.143-05:00Asymptotics of R(4,k)- a new result!<p> At the workshop </p><p><i>Ramsey Theory: Yesterday, Today, and Tomorrow, </i>Edited by Alexander Soifer, 2011. (There is a printed proceedings that you can find.) <br /></p><p></p><p> I saw Joel Spencer give a great talk titled </p><p> <i>80 years of R(3,k).</i></p><p>(<i> </i>Recall that R(a,b) is the least n such that for all 2-colorings of the edges of K_n there is either a red K_a or a blue K_b).</p><p><i> </i>The talk was about improvements on both the upper and lower bound on R(3,k) and finally: <br /></p><p> R(3,k) = \(\Theta\biggl (\frac{k^2}{\ln^2 k}\biggr )\).<br /></p><p>The obvious question was raised: What about R(4,k). The general sense I got was that this would be a much harder problem. However, there has been some progress. A recent paper, <a href="https://arxiv.org/pdf/2306.04007.pdf">here</a>, improved the best known lower bound, so it now stands at</p><p> \( c_1\frac{k^3}{\log^4 k} \le r(4,k) \le c_2\frac{k^3}{\log^2 k} \)</p><p>How long before we see matching upper and lower bounds?</p><p>1) How long did it take to get matching upper and lower bounds for R(3,k). The name of the talk would make one think 80 years, but I would start at a paper of Erdos from 1961 which had the first non-trivial lower bounds. And it was solved in 1995, so that's 34 years. (Note, the talk of Spencer was also on later algorithmic aspects of the problem). </p><p>2) Argument for why matching bounds on R(4,k) will be found in \(\le 10\) years: There are more people using more sophisticated tools then were known for the R(3,k) search.</p><p>3) Argument for why matching bounds on R(4,k) will take (\ge 20\) years: This problem is dang hard! Triangles are much easier to deal with then 4-cliques. <br /></p><p>This is a general problem math has: If a problem is not been solved, is it just dang hard, or are people one or two (or some small finite number) steps away from solving it? <br /></p>https://blog.computationalcomplexity.org/2023/09/asymptotics-of-r4k-new-result.htmlnoreply@blogger.com (gasarch)0tag:blogger.com,1999:blog-3722233.post-6768931725127470990Wed, 06 Sep 2023 19:45:00 +00002023-09-06T14:46:20.022-05:00Books to Inspire Math<p>Two of my colleagues and co-authors from my early days at the University of Chicago have released books over the past few months designed to excite people with math, Howard Karloff's <i><a href="https://link.springer.com/book/10.1007/978-3-031-33203-6">Mathematical Thinking: Why Everyone Should Study Math</a></i> and Lide Li's <i><a href="https://www.cambridgescholars.com/product/978-1-5275-0502-5">Math Outside the Classroom</a>. </i>Karloff was a fellow professor and Li was my PhD student. Neither are currently in academia but both still found the need to inspire young people in mathematics.</p><p></p><div class="separator" style="clear: both; text-align: center;"><div class="separator" style="clear: both; text-align: center;"><a href="https://link.springer.com/book/10.1007/978-3-031-33203-6" style="margin-left: 1em; margin-right: 1em;"><img border="0" data-original-height="1123" data-original-width="712" height="320" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgmFF-nKKpJ1vIr0CB6UYhMFWlM-p9M2IFcZFUWH4Dku2v_B3hyxcBDTmuMFPukuSk_mtleaV90P_VkqMQhkiaBKxRC6h1FIjvvfzI_Y8EKKbQqKwC5If-A6cJCWkS9MWUqwhtW9-4srIJRIvectazPKjDQOAtv60H_O8BmAoKTz9bxfwY-7s1q/s320/Karloff.png" width="203" /></a><a href="https://www.cambridgescholars.com/product/978-1-5275-0502-5" style="margin-left: 1em; margin-right: 1em;"><img border="0" data-original-height="2522" data-original-width="1819" height="320" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiM7NKfPWRz2-x2JAERa0VzimqDBB6Frk6W-WNxiRsttzXxficPPQTcrzQxA0JR4SpORJlAqPqJcMWGb0T6j9o_4YbcAhRWPF5TKBwZBVA7UxwDvUVdSvfXTws481rdjTCc_W9dt0GSNapQ2aniyRr8AodXNv7nE1syPE2VdYk4XnPcoB1bLGm9/s320/Lide%20Li.jpg" width="231" /></a></div><br /></div><br />Both books aim to make math fun, away from the rote problem solving from high school and early calculus courses to concepts like prime and irrational numbers (Karloff) and sequences and geometric shapes (Li). The books have some overlap, both cover deriving <i>e </i>from interest rates and probability including the Monty Hall problem. Both books have lots of problems to work on. <p></p><p>Between the two I would suggest Karloff's book for junior high/high school age kids and Li's book for older high school and early college students given the topics covered.</p><p>At a time that math plays a larger role in our society, especially dealing with data, finding ways to get more young people interested in mathematics is important. These books fill an important niche for the mathematically curious students to dive in topics they won't likely see in their math classes. Great to see my former colleagues taking the time to reach these students through these books. </p>https://blog.computationalcomplexity.org/2023/09/books-to-inspire-math.htmlnoreply@blogger.com (Lance Fortnow)6tag:blogger.com,1999:blog-3722233.post-2283317124405593073Mon, 04 Sep 2023 02:11:00 +00002023-09-05T08:55:15.049-05:00The CONTRADICTION of Margaritaville and other songs<p>Jimmy Buffett passed away on Sept 1, 2023. His Wikipedia entry (see <a href="https://en.wikipedia.org/wiki/Jimmy_Buffett">here</a>) says his death was peaceful and he was surrounded by friends, family, and his dog, so it was likely expected and of natural causes. I later saw a report that he had a serious skin cancer. He was 76. </p><p>He is not related to Warren Buffett--- they actually took a DNA test to find out, see <a href="https://metro.co.uk/2023/09/02/jimmy-buffett-dead-warren-buffett-dna-test-related-19436185/">here</a>. They are friends. Buffett isn't that common a name, see <a href="https://forebears.io/surnames/buffett">here</a>, so it was plausible they were related, but, alas, they are not. <br /></p><p>His signature song is <a href="https://www.youtube.com/watch?v=ue2-ZVxpVjc">Margaritaville</a> (My spellcheck thinks that I misspelled Margaritaville but I checked it and it looks fine. OR it's one of those things where I keep misreading it.) It wasn't just his signature song---he made a career of it outside of music, see <a href="https://www.margaritaville.com/">here</a>.</p><p>Jimmy Buffett fans are called parrot heads.</p><p>There are songs where the lyrics are <i>misheard. </i>Margaritaville is not one of them. Instead, its lyrics are <i>misunderstood</i>. This raised the question:</p><p>There are other songs whose LYRICS and WHAT PEOPLE THINK ABOUT THEM are in CONTRADICTION. What caused the contradiction? Could I make this into a HW assignment the next time I teach logic? Not if my students are looking for their lost shaker of salt.</p><p>This link <a href="https://www.mentalfloss.com/article/57351/15-famous-songs-misunderstood-meanings">here</a> has 25 songs with misunderstood lyrics. Margaritaville comes in at the 24th. I think it should rank higher (lower index, higher ranking) but I can't complain since I am not an expert and they put in the work (unlike my ranking of satires of Bob Dylan, <a href="https://www.cs.umd.edu/~gasarch/dylan/best.pdf">here</a>, where I am an expert and I put in the work). <br /></p><p>I list a few of the songs, plus two more, and WHY the contradiction. I also listened to them with the following question: ONCE you know what the song is supposed to be about and you listen to it, do you say OF COURSE THAT'S WHAT ITS ABOUT or REALLY? I STILL DON"T SEE IT. This is similar to reading a math proof knowing where it is going so perhaps you say OF COURSE. Of course, you might also say REALLY? I STILL DON"T SEE IT.</p><p> The name of the song in the list below is also a pointer to a video of it. <br /></p><p><a href="https://www.youtube.com/watch?v=VOgFZfRVaww">Imagine</a> by John Lennon. People think it's about peace and love. The writer John Lennon (not be be confused with Vladimr Lenin) says it's a Communist manifesto. I just listened to it and OF COURSE it's a Communist Manifesto- but its sung with such an optimistic loving tone that one could miss that. This is John Lennon's best known post-beatles song. <br /></p><p><a href="https://www.youtube.com/watch?v=lcOxhH8N3Bo">Total Eclipse of the Heart</a> by Bonnie Tyler. People think it's a power ballad- about love and such. Its actually a vampire love song. REALLY? I STILL DON"T SEE IT. A love song is a love song. It could be about humans, vampires, or, in the case of <a href="https://www.youtube.com/channel/UCE-ltWxQ5XhqErdQcX2k1Ag">The Klein Four</a>, Math, but unless they put something Vampire-ish into it, you can't tell its about Vampires. Two notes: (1) Its Bonnie Tyler's biggest hit, and <br />(2) it was released in 1983 but also had a large number of sales in 2017. Why? Either guess or see <a href="https://www.tmz.com/2017/08/21/bonnie-tyler-total-eclipse-of-the-heart-number-one-song-during-solar-eclipse/">here</a>.</p><p><a href="https://www.youtube.com/watch?v=Man4Xw8Xypo">Blackbird</a> by the Beatles. People think its just about a blackbird with a broken wing. Its about civil rights for blacks (or all countries- so I can't use the term <i>African American</i>) REALLY? I STILL DON"T SEE IT. I believe the Beatles intended that meaning. They also would not play to audiences that had rules about Whites only, or were segregated. So YEAH for them, but I still don't see it. Or hear it. Why the contradiction? Perhaps if I heard it in 1968 I would have understood what it was about. Perhaps they really weren't that clear about it. Perhaps they had to avoid it being censored. <br /></p><p><a href="https://www.youtube.com/watch?v=EPhWR4d3FJQ">Born in the USA</a> by Bruce Springsteen. This is a well-known misunderstood song, so better to say People USED TO think it was a Pride-in-America song but it was really about the plight of lower class Americans, especially Vietnam War Veterans, after the war. OF COURSE ITS ABOUT THAT. Why was there the contradiction? (1) the chorus is loud and understandable and belts out BORN IN THE USA! as if that's a good thing, (2) the other lyrics are somewhat mumbled (I had to listen to it on a you tube video with closed caption to understand the song), (3) People hear what they want to hear. </p><p><i>Notes: </i>I was GOING to look up what The Boss's top hit ever was, expecting it to be <a href="https://www.youtube.com/watch?v=IxuThNgl3YA">Born to Run</a>, but that's only his 18th biggest hit. Born in the USA is 8th, and Secret Garden is 1st. Even so, I think of Born to Run as his best known song. Why? (1) It was sung as the opening number of the 2010 Emmy awards (not by him, but done really well- Jimmy Fallon does a GREAT Bruce Springsteen), see <a href="https://www.youtube.com/watch?v=s2d9UecusfQ">here</a> (2) there are several parodies of it, see <a href="https://www.youtube.com/watch?v=yhKJY_j2Uvc">born to Run (COVID)</a>, <a href="https://www.youtube.com/watch?v=QXpDtbb_5B4">Born to Run (Bridgegate)</a>, <a href="https://www.youtube.com/watch?v=yM4yuDO6ZhU">Meant To Be (a best man's song)</a>, <a href="https://www.youtube.com/watch?v=C_-B6EijcnI">Jedi are Done</a>. Having went to the effort to find parodies of <i>Born to Run </i>I then found parodies of <i>Born in the USA: <a href="https://www.youtube.com/watch?v=mfvjITE74QI">Bored in the USA (COVID)</a>, <a href="https://www.youtube.com/watch?v=ajvBZ6YKa8Y">Touched by the TSA</a>, <a href="https://www.youtube.com/watch?v=Rq71tm81nLw">Conned in the USA</a>, <a href="https://www.google.com/search?q=Bourne%27e+N+the+USA&rlz=1C1EJFC_enUS884US884&oq=Bourne%27e+N+the+USA&aqs=chrome..69i57j0i22i30j0i15i22i30j0i390i650.6171j1j15&sourceid=chrome&ie=UTF-8#fpstate=ive&vld=cid:c012fc25,vid:sRu07wrNB9U">Borune'D in the USA (cryptocurr)</a> </i>And there are more. Upshot: trying to find out what someone's best-known song is can be a quagmire, but at least I got to find some cool parodies.<br /></p><p><a href="https://www.youtube.com/watch?v=Qkuu0Lwb5EM">Who Let the Dogs Out</a> by the Bah Men. People thought this song was about ... Hmmm, I don't know what people thought. Perhaps it was about someone who let the dogs out. Its actually about how BAD it is when men cat-call women. OF COURSE ITS ABOUT THAT once you see the lyrics. Why the contradiction? Its really hard to understand anything except the chorus. Their biggest hit.</p><p><a href="https://www.youtube.com/watch?v=3l-WFZki9bU">The Macarena</a> by Los Del Rio. People tend to not listen to music that they dance to. So people really did not think it had a meaning. Also some of it is in Spanish. I can't write what it's about here since I may violate community standards as we did with a prior post (see <a href="https://blog.computationalcomplexity.org/2023/05/community-guidelines-that-ignore-history.html">here</a>). See <a href="https://popcrush.com/macarena-lyrics-dirty-explained/">here</a> for what the lyrics mean OR the list I pointed to above. If you listen to it or read the lyrics OF COURSE IT MEANS THAT! HOW DID I MISS IT? TOO BUSY DANCING! Why the contradiction- as I said above, its really a dance song. Their biggest hit.<i> </i></p><p><i>Note</i>: Dance Songs usually don't have that many words. Knuth (see <a href="https://www.cs.umd.edu/~gasarch/BLOGPAPERS/songcomplexity.pdf">here</a> for the original article and <a href="https://en.wikipedia.org/wiki/The_Complexity_of_Songs#:~:text=%22The%20Complexity%20of%20Songs%22%20is,little%20or%20no%20meaningful%20content.">here</a> for the Wikipedia page about it which has later results) noted that the complexity of <i>That's the way uh-uh I like it</i> is O(1). <br /></p><p><a href="https://www.google.com/search?q=margaritaville+youtube&sca_esv=562332091&rlz=1C1EJFC_enUS884US884&ei=s3X0ZK6jKM6g5NoPhoWmwAY&ved=0ahUKEwjuyPLHso6BAxVOEFkFHYaCCWgQ4dUDCA8&uact=5&oq=margaritaville+youtube&gs_lp=Egxnd3Mtd2l6LXNlcnAaAhgDIhZtYXJnYXJpdGF2aWxsZSB5b3V0dWJlMg4QABiKBRixAxiDARiRAjIEEAAYAzIFEAAYgAQyBhAAGBYYHjIGEAAYFhgeMgYQABgWGB4yBhAAGBYYHjIGEAAYFhgeMgYQABgWGB4yBhAAGBYYHkiWG1C7BVjmGHABeAGQAQCYAZwBoAGmBKoBAzcuMbgBA8gBAPgBAcICChAAGEcY1gQYsAPCAgoQABiKBRiwAxhDwgIKEC4YigUYsAMYQ8ICDhAAGOQCGNYEGLAD2AEBwgIQEC4YigUYyAMYsAMYQ9gBAsICExAuGIoFGOUEGMgDGLADGEPYAQLCAhwQLhiKBRjHARivARiYBRiaBRjIAxiwAxhD2AECwgIWEC4YigUYxwEY0QMYyAMYsAMYQ9gBAsICDRAuGIoFGLEDGIMBGEPCAg0QLhiDARixAxiKBRhDwgIHEAAYigUYQ8ICCxAAGIoFGLEDGIMBwgIQEC4YigUYsQMYgwEY5QQYQ8ICCxAAGIAEGLEDGIMBwgILEC4YgAQYsQMYgwHCAggQABiKBRiRAsICCBAAGBYYHhgP4gMEGAAgQYgGAZAGE7oGBggBEAEYCboGBggCEAEYCA&sclient=gws-wiz-serp#fpstate=ive&vld=cid:1b5dac05,vid:ue2-ZVxpVjc">Margaritaville</a> by Jimmy Buffett (I'd be curious to see a version by Warren Buffett). This is a well-known misunderstood song, so better to say that people USED TO think it celebrated a relaxed lifestyle but its actually a sad son about a drunk. OF COURSE THE SONG IS ABOUT BEING DRUNK AND DEPRESSED. So why the contradiction? The tune is so happy-go-lucky, and Jimmy Buffett (and others) talk POSITIVELY about <i>The Margaritaville lifestyle. </i>Whats really odd is that the real meaning of the song IS WELL KNOWN, yet is ignored.</p><p><i>Note:</i> A more realistic take on this topic, to the same tune, is <a href="https://www.google.com/search?q=Margaritaville+you+tube+parody&rlz=1C1EJFC_enUS884US884&oq=Margaritaville+you+tube+parody&aqs=chrome..69i57j33i10i160l2.8691j1j15&sourceid=chrome&ie=UTF-8#fpstate=ive&vld=cid:bc24a47b,vid:Tkt_LR3A8lQ">here</a>. A Marijuana version of the song is <a href="https://www.youtube.com/watch?v=TZodwxTsgQY">here</a>. A crystal meth version of the song is <a href="https://www.youtube.com/watch?v=IB3FBIyr4lE">here</a>. There are FOUR parodies that are NOT about being drunk, high, or on Crystal-meth, but about... COVID: <a href="https://www.google.com/search?q=Margaritaville+you+tube+parody&rlz=1C1EJFC_enUS884US884&oq=Margaritaville+you+tube+parody&aqs=chrome..69i57j33i10i160l2.8691j1j15&sourceid=chrome&ie=UTF-8#fpstate=ive&vld=cid:bcb13031,vid:9GfwMrP4Lw4">here</a>, <a href="https://www.google.com/search?q=Margaritaville+you+tube+parody&rlz=1C1EJFC_enUS884US884&oq=Margaritaville+you+tube+parody&aqs=chrome..69i57j33i10i160l2.8691j1j15&sourceid=chrome&ie=UTF-8#fpstate=ive&vld=cid:0517ceb5,vid:TQfea3AnY6I">here</a>, <a href="https://www.google.com/search?q=Margaritaville+you+tube+parody&rlz=1C1EJFC_enUS884US884&oq=Margaritaville+you+tube+parody&aqs=chrome..69i57j33i10i160l2.8691j1j15&sourceid=chrome&ie=UTF-8#fpstate=ive&vld=cid:132be2cb,vid:BlDGrTZ2X08">here</a>, and <a href="https://www.google.com/search?q=Margaritaville+you+tube+parody&rlz=1C1EJFC_enUS884US884&oq=Margaritaville+you+tube+parody&aqs=chrome..69i57j33i10i160l2.8691j1j15&sourceid=chrome&ie=UTF-8#fpstate=ive&vld=cid:c9016741,vid:ddwBYY-_Ums">here</a>. </p><p><i><a href="https://www.google.com/search?q=99+red+balloons+you+tube&rlz=1C1EJFC_enUS884US884&oq=99+red+balloons+you+tube&aqs=chrome..69i57j0i10i512j0i390i650l3.5287j1j15&sourceid=chrome&ie=UTF-8#fpstate=ive&vld=cid:dd178dbc,vid:hiwgOWo7mDc">99 Red Balloons</a> or </i> <a href="https://www.google.com/search?q=99+luft+ballons+you+tube&rlz=1C1EJFC_enUS884US884&oq=99+luft+ballons+you+tube&aqs=chrome..69i57j0i13i512j0i10i22i30i625j0i5i13i30l3j0i8i13i30l4.5795j1j15&sourceid=chrome&ie=UTF-8#fpstate=ive&vld=cid:f2587733,vid:Fpu5a0Bl8eY">99 Luft ballons (the original German Version)</a> To quote the original link: <i>Whether in its original German language or in English, the happy-pop New Wave jam is easily the most danceable <a class="tagStyle_18h2erd-o_O-style_1i5d9um" href="https://popcultureexperiment.com/2018/03/26/cover-songs-uncovered-99-luftballons-99-red-balloons/" target="_blank">song about</a> a nuclear holocaust caused by balloons. </i>When I listened to it and read the lyrics OF COURSE ITS ABOUT A NUCLEAR HOLOCAUST CAUSED BY BALLOONS. Why the contradiction? The more popular version is in German, the English version is a bit mumbled (but not much), but most importantly, if there is going to be a nuclear holocaust caused by balloons I will get up and dance!<br /></p><p><i>Note: </i>I knew of one parody <a href="https://www.youtube.com/watch?v=g9Lt1rwj6R8">99 Dead Baboons</a>, but through the wonders of search and you tube I found more: <a href="https://www.youtube.com/watch?v=_GiNmNm9lJw">the social media song</a>, <a href="https://www.youtube.com/watch?v=EUjlFjJa54I">99 90s shows</a>, <a href="https://www.youtube.com/watch?v=9SP_8m3vK9g">99 unused balloons</a>, <a href="https://www.youtube.com/watch?v=o4nVQbM_1ME">99 Steins of Beer</a> </p><p>For two more, though they are not on the list, see <a href="https://sojo1049.com/the-song-if-you-like-pina-coladas-is-pretty-messed-up-heres-why/">'The Pina Colada' Song is Really Messed up</a> and <a href="https://faroutmagazine.co.uk/beastie-boys-hate-fight-for-your-right/">Why the Beastie Boys Hate `Fight for your right to Party'</a></p><p>TO SUM UP: songs that get misunderstood may (1) have some hard to understand lyrics, (2) be dance songs, (3) have the melody and instruments be at odds with the lyrics, (4) have lyrics that people want to hear and others that they don't, (5) be partly or wholly in a foreign language. I am sure there are other reasons. </p><p><b>Jimmy Buffett: You will be missed! </b><br /></p><p><br /></p><p><br /></p><p><br /></p><p><br /></p><p><br /></p>https://blog.computationalcomplexity.org/2023/09/the-contradiction-of-margaritaville-and.htmlnoreply@blogger.com (gasarch)8tag:blogger.com,1999:blog-3722233.post-1404266269380906120Wed, 30 Aug 2023 20:26:00 +00002023-08-30T15:28:02.780-05:00What Makes a Constructive Proof?<p>In this weblog, we've used constructive in different ways. Often we talk about constructive as something we can create in polynomial time, like an <a href="https://blog.computationalcomplexity.org/2004/11/zig-zag-connectivity.html">expander</a>. But how about constructive as in logic, when you don't get to assume the "excluded middle" where you get to assume some statement is either true or false?</p><p>The simplest well-known example is the theorem: There exists irrational \(a\) and \(b\) such that \(a^b\) is rational. </p><p></p><ol style="text-align: left;"><li>\(\sqrt{2}^\sqrt{2}\) is rational. Let \(a = b = \sqrt{2}\).</li><li>\(\sqrt{2}^\sqrt{2}\) is irrational. Let \(a = \sqrt{2}^\sqrt{2}\) and \(b = \sqrt{2}\).</li></ol><div>You don't know which \(a\) is correct. You just know it exists. (A far more complicated argument shows \(\sqrt{2}^\sqrt{2}\) is <a href="https://en.wikipedia.org/wiki/Irrational_number#Irrational_powers">in fact irrational</a>.) </div><div><br /></div><div>When I teach intro theory, my first proof that there are non-computable sets is by claiming the computable sets are countable but their are an uncountable number of sets over \(\Sigma^*\) so there must be an non-computable sets. I claim this is a non-constructive proof because I didn't give you the set and do an aside on constructive proofs using the example above. But that's not correct--the proof that there are uncountable number of sets over \(\Sigma^*\) is a constructive diagonalization. Give me an enumeration of the computable sets and I can easily construct a set not on that list.</div><div><br /></div><div>In complexity, a well-known non-constructive theorem is by Kannan, showing that \(\Sigma^P_2\) does not have \(n^2\)-size circuits.</div><p></p><div><ol style="text-align: left;"><li>SAT doesn't have n<sup>2</sup>-size circuits. Since SAT is in Σ<sub>2</sub> we are done.</li><li>SAT has n<sup>2</sup>-size circuits. Then by <a href="http://dx.doi.org/10.1145/800141.804678">Karp-Lipton</a> Σ<sub>4</sub> = Σ<sub>2</sub> so L is in Σ<sub>2</sub> and we are done.</li></ol><div>Jin-Yi Cai and Osamu Watanabe, and independently Sunny Daniels, gave a <a href="https://blog.computationalcomplexity.org/2014/08/sixteen-years-in-making.html">constructive \(\Sigma^2_P\) machine</a> and thus a single language in \(\Sigma^P_2\) that doesn't have \(n^2\)-size circuits. But it is not a constructive proof, as the argument the machine works requires the two cases as to whether SAT has small circuits. As far as I know, a true constructive proof of Kannan's theorem remains open.</div></div><div><br /></div><div>I have no problem with non-constructive proofs—I'm in a firm believer in \(P\vee\neg P\). But if you do talk about constructivity be sure and use it appropriately. </div><p></p>https://blog.computationalcomplexity.org/2023/08/what-makes-constructive-proof.htmlnoreply@blogger.com (Lance Fortnow)12tag:blogger.com,1999:blog-3722233.post-5971210651823745104Mon, 28 Aug 2023 01:14:00 +00002023-08-27T20:14:58.104-05:00Theorems and Lemmas and Proofs, Oh My!<p>I was recently asked by a non-mathematician about the difference between the terms Theorem, Lemma, etc. My first reaction was <i>I probably have a blog post on that</i>. Actually, I looked and I don't seem to. Since I have, according to Ken Reagan, over 1000 posts (see <a href="https://rjlipton.wpcomstaging.com/2022/01/29/bill-gasarch-also-1000/">here</a> and <a href="https://blog.computationalcomplexity.org/2022/01/regan-lipton-celebrates-my-1000th-blog.html">here</a>) I can easily confuse things I <i>meant to write a post on </i>with things I <i>wrote a post on. </i>My next thought was <i>Lance probably has a post</i> <i>on that. </i>I asked him, and he also thought he had, but also had not. <b>So now I will!</b></p><p><b>Open Question:</b> A well defined question that you don't know the answer to and may not even have a guess as to which way it goes. The above is not quite right: sometimes an open question is not that well defined (e.g., Hilbert's 6th problem: Makes Physics Rigorous) and sometimes you have some idea, or a rooting interest, in how it goes. I tried to find some open questions in Mathematics where people in the know don't have a consensus opinion. I can think of two off hand: Is Graph Isom in P? and is Factoring in P. Maybe the Unique Game Conjecture, though I think people in the know think it's true. Here is a website of open questions, but I think for all of them people in the know think we know how they go: <a href="https://en.wikipedia.org/wiki/List_of_unsolved_problems_in_mathematics">here</a>.</p><p><b>Conjecture:</b> A statement that you think is true, and may even have some evidence that its true, but have not proven yet. I am used to using this term in math, and hence I hope someone will PROVE the conjecture. Are there conjectures in empirical sciences? If so, then how do they finally decide it's true? Also note- I blogged about conjectures and how once they are proven the conjecturer is forgotten <a href="https://blog.computationalcomplexity.org/2009/08/how-much-credit-should-conjecturer-get_14.html">here</a>. EXAMPLES OF CONJECTURES: The same link as in open problems above. </p><p>True story but I will leave out names: There was a conjecture which I will call B's Conjecture. C & S solved it AS WRITTEN but clearly NOT AS INTENDED. Even so, C & S got a published paper out of it. This paper made M so mad that he wrote a GREAT paper that solved the conjecture as intended (and in the opposite direction). That paper also got published. So one conjecture lead to two opposite solutions and two papers. </p><p><b>Wild-Ass Guess: </b>You can take a wild-ass guess what this is. </p><p><b>Hypothesis: </b>An assumption that you may not think is true but are curious what may be derived from it. <i>The Continuum Hypothesis</i> is one. For some reason Riemann's problem is called <i>The Riemann</i> <i>Hypothesis</i> even thought it's really a conjecture. So is my notion of Hypothesis wrong? In any case, if you know other things that are called Hypothesis then please leave a comment. </p><p><b>Lemma: </b>A statement that is proven but only of interest in the service of proving a theorem. There are exceptions where a Lemma ends up being very important, see <a href="https://en.wikipedia.org/wiki/List_of_lemmas">here</a>. The word is also used in English, see <a href="https://simple.wikipedia.org/wiki/Lemma_(linguistics)#:~:text=A%20lemma%20is%20a%20word,you%20find%20in%20the%20dictionary.">here</a>, but I've never heard of the word being used that way.</p><p><b>Theorem: </b>A statement that has been proven. Usually it is somewhat general. There are a few exceptions: Fermat's Last Theorem was called that before it was a Theorem. If you know other things that were called theorems but weren't, please comment. EXAMPLES OF THEOREMS: The Fundamental Theorem of X (fill in the X), Ramsey's Theorem, VDW's theorem, Cook-Levin Theorem, The Governor's theorem (see <a href="https://blog.computationalcomplexity.org/2013/08/how-much-trig-does-your-governor-know.html">here</a>). There are many more theorems that have names and many that do not. </p><p><b>Corollary: </b>A statement that follows directly from a Theorem. Perhaps an interesting subcase of a Theorem. Often this is what you really care about. When trying to find a famous corollary I instead found <a href="https://en.wikipedia.org/wiki/Roosevelt_Corollary">The Roosevelt Corollary to the Monroe Doctrine</a>, <a href="https://www.cut-the-knot.org/pythagoras/corollary.shtml">Corollaries of the Pythagorean theorem</a>, and <a href="https://www.collinsdictionary.com/us/sentences/english/corollary">Uses of the word Corollary in English</a>. Are there any famous corollaries in mathematics that have names?</p><p><b>Claim:</b> I do the following though I do not know if its common: During a proof I have something that I need for it, but it is tied-to-the-proof-of-the-theorem so it would be hard to make a lemma. So I prove it inside the proof of the theorem and call it a claim. I use Claim, Proof of Claim, End of Proof of Claim to delimit it. </p><p><b>Porism: </b>A statement that you can get from a theorem by a minor adjustment of the proof. I've also heard the phrase <b>Corollary of the proof of Theorem X. </b>I first saw this in Jefferey Hirst's Phd Thesis which is <a href="http://www.appstate.edu/~hirstjl/bib/pdf/jhthesis.pdf">here</a>, on Reverse Mathematics. I liked the notion so much I've used it a few times. It does not seem to have caught on; however, there is a Wikipedia entry for the term <a href="https://en.wikipedia.org/wiki/Porism">here</a> which also gives two examples of its use, which are not from Hirst's thesis or my papers. </p><p><b>Proposition: </b>I see this so rarely that I looked up what the difference is between a Proposition and a Theorem. From what I read a Proposition is either of lesser importance, or is easy enough to not need to give a prove, as opposed to a Theorem which is important and needs a proof.</p><p><b>Axiom</b>: A statement that one assume is true and usually they are self-evident and true. Exceptions are The Axiom of Choice which some people reject since it is non-constructive. Also some people do not thing The Axiom of Determinacy is self-evident. Same for Large Cardinal Axioms. But really, most axioms are self-evident. Note that all branches of math use Axioms.</p><p><b>Postulate: </b>Euclid used the term Postulate instead of Axiom. Actually, Euclid wrote in Ancient Greek so to say he used the term Postulate is probably not quite right. However, the term Postulate seems to mean an axiom of Euclid's, or perhaps an axiom in Geometry. One exception: <a href="https://math.stackexchange.com/questions/1920672/why-is-bertrands-postulate-called-a-postulate">Bertrand's Postulate</a> which was a conjecture but is now a theorem. The link is to a math-stacks where there is some explanation for the weird name. </p><p><b>Paradox: </b>A Paradox is a statement that is paradoxical. Hmmm. that last sentence is self-referential, so its not enlightening. A paradox is supposed to be a statement that seems absurd or self contradictory, though under closer examination may make sense. Russell's Paradox shows that Frege's definition of a set does not work. The Monty Hall paradox, and the Banach-Tarski Paradox are just theorems that at first glance seem to be absurd. The Monty Hall Paradox is not absurd. Darling thinks the BT-paradox means that math is broken, see this post <a href="https://blog.computationalcomplexity.org/search?q=Banach">here</a> for more on that.<br /></p><p><br /></p><p><br /></p><p><br /></p><p><br /></p>https://blog.computationalcomplexity.org/2023/08/theorems-and-lemmas-and-proofs-oh-my.htmlnoreply@blogger.com (gasarch)10tag:blogger.com,1999:blog-3722233.post-845237140318021774Thu, 24 Aug 2023 15:35:00 +00002023-08-24T10:35:27.526-05:00Transcripts for the 21st Century<p>When I start a new academic job, I need to prove that I actually have a PhD. I have to log in my MIT alumni page, pay my $10 and they email my graduate transcript to whomever, all to verify that one bit of information. Why don't I just have a digitally signed certificate I can just hand over?</p><p>Our CS department spends an inordinate amount of time looking through transcripts of accepted Masters students to determine if they the right prerequisites for various classes. Great if could automate this process but the transcript come in PDF or JPEG and don't have a standardized format, especially from foreign countries. Also a course name does not give enough information to know what it covers. </p><p>The Chronicle of Higher Education did a forum on <a href="https://www.chronicle.com/featured/digital-learning-higher-ed/transcript-of-the-future">The Transcript of the Future</a>, and maybe some solutions to these problems on the horizon. Here are three potential future trends and an elephant in the room.</p><p><b><span style="font-size: medium;">Modality</span></b></p><p>Since I went to school, transcripts have moved from paper to PDF. PDFs work for humans to look at, but don't work well to feed into computers to allow for better analysis. Transcripts should move to a structure format, perhaps JSON, to make them readable to machines. It's easy to go from JSON to PDF but less easy in the other direction. </p><p>To make this work you need a standards so each university's transcript doesn't use a different format. Some standards are in the works but this doesn't seem quite settled yet, as best I can figure out from Internet searching.</p><p><b><span style="font-size: medium;">Content</span></b></p><p>Once you go digital you can add much more information. You can add a syllabus, the topics a course covers, not just its title. You can add competencies, credentials, certificates, projects and skills achieved. You can add student's activities such as internships, athletics, clubs, leadership roles. You can give grad schools and companies a much fuller picture of a student beyond the grades.</p><p>The more stuff we stick into a transcript, the more standards you need to make sense of it. </p><p><b><span style="font-size: medium;">Provenance</span></b></p><p>Who owns the transcript? Right now it is the university, that's why I have to pay $10 for MIT to send it out. But why not in some common database, or on a blockchain, or a file owned by an individual with all the proper technology so it can't be forged. There are privacy and security issues that we would need to figure out. You don't want a student to lose access to a transcript because they lost a password, the way many have lost cryptocurrency. </p><p><b><span style="font-size: medium;">Artificial Intelligence</span></b></p><p>If we do have access to standardized digital transcripts, there will be the temptation to outsource to AI decision making related to them, such as job interviews (already happening) and grad admissions. We can use AI responsibly to help in the process but we need to remember that all these students are individuals and we need people to judge the people behind them.</p>https://blog.computationalcomplexity.org/2023/08/transcripts-for-21st-century.htmlnoreply@blogger.com (Lance Fortnow)0tag:blogger.com,1999:blog-3722233.post-2360020801307642666Mon, 21 Aug 2023 16:53:00 +00002023-08-21T11:53:00.980-05:00Why I have some sympathy for the Simulation Theory (We are all characters in a video game.) <p>There are some people who believe that we are all characters in a video game written by Abisola (this is sometimes called <i>The</i> <i>S</i>i<i>mulation Hypothesis</i>). I first dismissed this as nonsense. Then I read about it in the great book <i>But What if We're Wrong </i>by Chuck Klosterman. He had some reasons why The Simulation Hypothesis is plausible. I thought about some more examples of his reasons. I still DO NOT believe it, but the reasons TO believe it do raise some questions.</p><p>There is one word that describes all of the reasons: Glitches! That is Abisola, who wrote the code, made some mistakes that sometimes show through. Actually some might not be mistakes, perhaps Abisola, planned it. She has the bug/feature issue as do we. </p><p>Here are some of those glitches: </p><p>1) Real people who, from an accident, gained an ability that they did not have before.</p><p>a) <a href="https://en.wikipedia.org/wiki/Jason_Padgett">Jason Padget</a>: After being attacked and getting a concussion, woke up and was a math genius. </p><p>b) <a href="https://en.wikipedia.org/wiki/Derek_Amato">Derek Amato</a>: After a head injury became a brilliant composer.</p><p>c) <a href="https://www.dailymail.co.uk/news/article-3443540/Man-woke-coma-speaking-fluent-MANDARIN-car-accident-goes-Chinese-dating-finds-girlfriend.html">McMahon</a>: After a head injury woke up speaking fluent mandarin. I could not find a Wikipedia Entry for him.<br /></p><p>d) Tony Cicero: After being struck my lightening was an excellent musician. I read this on a Quora entry but could not find it anywhere else. If you have more evidence on this one, please leave a comment and I will add it here later. <br /></p><p>2) While I dismiss most accounts of ghosts, ESP, miracles, etc, there are so many of them that perhaps some are real and caused by glitches. Or features. </p><p>3) This happens a lot to me and I am sure others (or analogs of it): I have a LaTeX bug. I delete a line. The bug goes away. I put the line back. Now the bug is gone. </p><p>4) <a href="https://en.wikipedia.org/wiki/The_dress">What color is the dress? </a></p><p>5) Neil Degrasse Tyson and Elon Musk are fans of the Simulation Hypothesis.Not sure if this is any kind of justification for the Simulation Hypothesis or if Abisola coded them up to be that way.</p><p>6) All of a sudden the spell-check mechanism this blogger uses stops working AND when I leave a comment it does not automatically put my name on it, nor does it automatically bypass moderation (which is how it used to work). Lance and I try to fix it, to no avail. The staff here tries to fix it, to no avail. a week later it works again. And YES the first thing I did was turn everything off and on again and that didn't work. (Update: this problem seems to come and go.) </p><p>7) A watched pot never boils. Lost socks in the laundry. Etc. <br /></p><p>8) On a more positive side, <a href="https://www.maths.ed.ac.uk/~v1ranick/papers/wigner.pdf">The Unreasonable Effectiveness of Mathematics in the Natural Sciences</a> and <a href="https://ncatlab.org/nlab/show/The+Unreasonable+Effectiveness+of+Physics+in+the+Mathematical+Sciences">The unreasonable effectiveness of Physics in the Mathematical Sciences</a>. You can google to find more unreasonable effectiveness's. Thanks Abisola, though I wish you made Physics and Math easier. <br /></p><p>9) I emailed a HIGH-TECH colleague. My system says that YES I send that mail. He remembers READING that email when it came. Later on he can't find it- not in is normal files, not in trash, not in spam. gmail search can't find it anywhere. (My spell check thinks gmail is not a word. Nor Gmail. Really?) <br /></p><p>10) The speed by which humans went from PONG to DWARF FORTRESS is not plausible. Maybe Abisola found a way to speed up her program. (This observation has been made by others.) <br /></p><p>11) A relative got Eye Surgery recently. (a) The technology for the surgery was fantastic- outpatient, able to drive in 3 days, drive at night in 7 days, totally painless. (b) Still waiting for the paperwork that will allow him to drive without glasses. Gee- eye surgery should be hard, and paperwork should be easy. I think Abisola found switching the two to be amusing. </p><p>12) Aaronson's law of dark irony, see <a href="https://scottaaronson.blog/?p=7278">here</a>.</p><p>13) The possibility of Elon Musk and Mark Zuckerberg having an actual physical fight (see <a href="https://www.theverge.com/2023/6/21/23769263/mark-zuckerberg-elon-musk-fight-cage-match-worldstar">here</a>), makes no sense. Whatever they disagree on (e.g., how a social network should be run, who is wealthier, who has the biggest....) will NOT be settled by a fight. If M wins then we know that M can beat Z in a fight. That is all that will be established. If Z wins then we know that Z can beat M in a fight. That is all that will be established. In both cases a fight will not settle whatever they disagree on. So why might they fight? Ask Abisloa if it is a bug or a feature. </p><p>14) I am sure you can add your own reasons. </p>https://blog.computationalcomplexity.org/2023/08/why-i-have-some-sympathy-for-simulation.htmlnoreply@blogger.com (gasarch)29tag:blogger.com,1999:blog-3722233.post-135359919926252404Tue, 15 Aug 2023 12:56:00 +00002023-08-15T07:56:58.107-05:00Turning Sixty<p>I turn sixty today, spending my birthday reviewing a computer science department in Asia. Sixty is a good time to look back and reflect in a rambling way.</p><p>I started grad school in 1985. The P v NP problem was only 14 years old when I started. 38 years later we are no closer to solving it.</p><p>Nevertheless the field of computational complexity has remained strong, producing exciting research nearly every year. We're not seeing the surprising results that we saw through the early 90s but we've gained a much better understanding of pseudorandomness, coding theory, proof complexity, communication complexity, quantum complexity and circuit complexity (to an extent). The hard problems remain hard but that hasn't hampered progress in the field.</p><p>The field hasn't grown as dramatically as some others in theoretical computer science but neither has it shrunk. We have many great young researchers coming up in the field and its future is secure for decades to come.</p><p>I have some regrets for the field. Computational complexity has moved more towards mathematics with a focus on technical difficulty over conceptual novelty. We were quick to pick up on probabilistic, parallel and quantum computing, much slower on the cloud and machine learning. Combinatorial optimization has gotten extremely good, we can solve many NP-complete problems in practice, a point we rarely acknowledge.</p><p>For myself, I had an active research career for a good two decades. But then the field moved, away from my strength in the structure of complexity classes and more towards more combinatorial, algebraic and analytic techniques. A field should evolve but I found it difficult to keep up. So I focused on this blog, wrote a book, took on larger leadership and administrative roles. I try to follow what's going on in the field, but I'm happy to leave the research to the next generations, especially to my former students, several of whom have become leaders in the field themselves.</p><p>Someone recently asked me if I have regrets in my research career. I said that I’ve lived through some incredible advances in computing, but my research has played no significant role in any of it. </p><p>Nevertheless as the computing world, if not the world as a whole, continually gets more complex, computational complexity has a continual mission to make sense of it. And so we shall.</p>https://blog.computationalcomplexity.org/2023/08/turning-sixty.htmlnoreply@blogger.com (Lance Fortnow)12tag:blogger.com,1999:blog-3722233.post-2422798072194849803Wed, 09 Aug 2023 20:13:00 +00002023-08-09T15:13:09.719-05:00The Acting Professor<p>When I <a href="https://blog.computationalcomplexity.org/2008/06/impressions-of-c.html">taught Programming for Engineers</a> at Northwestern in 2008, the textbook gave access to PowerPoint slides I could use to teach the class. Since C++ is not a specialty of mine, I tried using the slides for the course. It just felt wrong and lazy--it wasn't me teaching and the students were picking up on it. So I went back to teaching my own way and even though I would occasionally make a mistake (or two or ten), they were my mistakes and the class learned better with me.</p><p>The Chronicle of Higher Education recently ran a <a href="https://www.chronicle.com/article/the-substitute-teacher">series on Courseware</a> where it goes much further.</p><blockquote><p>Romano’s instructor was using a courseware product from the publishing titan Cengage. In a departure from traditional supplementary class materials, like textbooks, many courseware tools offer the “soup to nuts” of an entire course: Not only the digital version of a textbook, but homework assignments and assessments that an instructor can select from a bank of premade options. Educational videos, slide presentations, and study flashcards. Auto-grading and performance-analytics capabilities.</p></blockquote><blockquote><p>It all made for an underwhelming, and often frustrating, learning experience. “There were never ways we could learn from the instructor,” said Romano, who double-majored in political science and environmental science. “It was just a really weird class.” </p></blockquote><p>At what point are lecturers just actors, reading the material and running the course on autopilot? Is this an advantage over pre-recorded online courses?</p><p>With AI perhaps you remove the instructor completely and a course just becomes a fancy computer game. Will the students learn? Will they want to?</p>https://blog.computationalcomplexity.org/2023/08/the-acting-professor.htmlnoreply@blogger.com (Lance Fortnow)2tag:blogger.com,1999:blog-3722233.post-7486493523166407962Mon, 07 Aug 2023 00:57:00 +00002023-08-06T19:57:24.036-05:00Permutable Primes and Compatible Primes<p>This post is about an open problems column by Gasarch-Gezalyn-Patrick so they can be considered co-authors on this post. The column is <a href="https://www.cs.umd.edu/~gasarch/open/don.pdf">here</a>.<br /></p><p><b>Known:</b> A <i>permutable prime</i> is a prime so that, no matter how you permute the digits, you get a prime.</p><p>The first 22 of them are: <br /></p><p>2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, 97, 113, 131, 199, 311, 337, 373, 733, 919, 991.</p><p>11 might seem like a silly example. However, all of the known ones past 991 are just all 1's. Let \(R_n\) be the base 10 number which is represented by n 1's. </p><p>The next three permutable primes are \(R_{23}\), \(R_{317}\), \(R_{1031}\). </p><p>Those are all of the permutable primes that are known. The 2 conjecture is that there are </p><p>(1) there are an infinite number of them</p><p>(2) all those past 991 are of the form \(R_n\). </p><p>There is more information and more conjectures about them in the open problems col pointed to above. <br /></p><p>I know of three online papers on permutable primes, see my website of them <a href="https://www.cs.umd.edu/~gasarch/TOPICS/permprimes/permprimes.html">here</a>.</p><p><b>New: </b>A number <i>n</i> is a<i> k-compatible</i> (henceforth <i>k</i>-comp) prime if there are <i>k</i> permutations of <i>n</i> that are prime but not<i> k+1 </i>such permutations.</p><p>Examples:</p><p>a) 103 is 3-comp: 013, 031, 103 are prime BUT 130, 310,301 are NOT prime.<br /></p><p>b) 97 is 2-comp: 79 and 97 are prime and there are no other perms of 97.<br /></p><p>c) 41 is 1-comp: 41 is prime BUT 14 is NOT prime. </p><p>We have some (though not much) empirical data that suggests the following. Fix L, the length of numbers being considered. If you look at L-length primes that are 1-comp, 2-comp, etc the number of them will (with some exceptions) first increase then (with some exceptions) decrease, though past k=L/2 (actually smaller) the are no L-length, k-comp primes. </p><p>For rigorous conjectures and more information see the paper pointed to above. </p><p><br /></p>https://blog.computationalcomplexity.org/2023/08/permutable-primes-and-compatible-primes.htmlnoreply@blogger.com (gasarch)7tag:blogger.com,1999:blog-3722233.post-8106728170115157192Wed, 02 Aug 2023 15:25:00 +00002023-08-02T10:25:02.278-05:00The College Visits<div class="separator" style="clear: both; text-align: center;"><a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiIuGI-AxSY2S2C0Kmho67qjepJVI5U8ToSzYjkY0g_DGnL3EqGWd8OapOqYb0ddU4OqQumM3rEBDaNJpXrNnNgl2igDEAgYmqwZItnlV362T1wKhhJT2sWM5OmL7LiIuwXCQ8v7hWYVgtL8_TjnLj1A6FkqSjhlmVTQ5q-0ZhUR1e8cLgkCtsE/s1024/campus%20tour.png" imageanchor="1" style="clear: right; float: right; margin-bottom: 1em; margin-left: 1em;"><img alt="Campus tour at an AI generated university" border="0" data-original-height="1024" data-original-width="1024" height="320" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiIuGI-AxSY2S2C0Kmho67qjepJVI5U8ToSzYjkY0g_DGnL3EqGWd8OapOqYb0ddU4OqQumM3rEBDaNJpXrNnNgl2igDEAgYmqwZItnlV362T1wKhhJT2sWM5OmL7LiIuwXCQ8v7hWYVgtL8_TjnLj1A6FkqSjhlmVTQ5q-0ZhUR1e8cLgkCtsE/w320-h320/campus%20tour.png" width="320" /></a></div>My wife's cousin and her daughter came and visited Chicago. The daughter, between junior and senior year of high school, is on the tail end of college tour season and visited Northwestern and University of Chicago while here. She's visited a dozen plus schools at this point.<div><br /></div><div>As an academic and administrator I think of universities in terms of the faculty who are there, their academic strengths and reputation and sometimes the internal and external politics (people like to talk). All academic departments and universities have issues, in their own unique ways.</div><div><br /></div><div>The visiting prospective students get a thoroughly different view: A tour highlighting the architecture and amenities, giving cherry-picked statistics that puts the school in its best light. The impressions students get have little to do with the quality of the education and can get affected by the personality of the tour guide or even the weather the day of the visit.</div><div><br /></div><div>The daughter is interested in computer science but the Northwestern tour focused on South campus, the more artsy part of the university where she wouldn't be spending much of her days. Her favorite school, which I won't name, has by far the weakest CS program of the ones she has visited. But it seems those first impressions are also the lasting ones.</div><div><br /></div><div>If you are a high school student take the tour but don't let that be your only impression. Track down the places on campus that matter to you, whether a department, college or extra-curricula and talk to the people there, particularly the students. Understand the parts of the university that matter to you, not just the ones that they put on display. </div><div><br /></div><div>Or perhaps avoid the campus visits entirely. You'll probably make a better choice if you aren't distracted by the size of the spires. </div>https://blog.computationalcomplexity.org/2023/08/the-college-visits.htmlnoreply@blogger.com (Lance Fortnow)4tag:blogger.com,1999:blog-3722233.post-2133628310493373749Mon, 31 Jul 2023 01:17:00 +00002023-07-31T09:14:53.058-05:00Another problem with CHATgpt<p> I was giving a recruiting talk for my REU program and I had some slides with testimonials from students:</p><p><br /></p><p>-------------------------------------------------------------------------</p><p>TESTIMONIAL ONE</p><p>This REU experience was greatly beneficial in expanding my knowledge and experience with machine learning. Dr. Gasarch, the mentors, my team, and the professors were all very supportive and encouraging, and I learned so much from them over the course of the program. The program was a perfect way to explore different research aspects and allow me to get a better idea of how research is conducted. I am very thankful for this experience.</p><p><br /></p><p>TESTIMONIAL TWO</p><div><div>The experience of REU CAAR was excellent. I participated in some research before, yet this is the first time for me to do research in a group, which was great!</div><div><br /></div><div>Though auction design as a topic was not familiar to me before, I learned it by reading several papers. Our program includes both mathematical and computer science components. That is nice as I am interested in both, and our group members divided the work so we all worked on stuff we cared about.</div><div><br /></div><div>Aside from the research, the lunches and talks were interesting. Thanks to Professor Gasarch, his helper Auguste, and all the mentors. I would recommend it to anyone interested in computer science or mathematics.</div></div><div>------------------------------------------------------------------</div><div><br />The students laughed and all said </div><div><br /></div><div><i>Those are obviously produced by CHAT-GPT.</i></div><div><i><br /></i></div><div>They weren't. In fact, they were emailed to me by students in August 2022 before CHAT-GPT was a thing. I told the audience that; however, I doubt they believed me and I didn't want to dwell on the point. The more you say its not CHAT-GPT, the more it sounds like it is. <br /></div><div><br /></div><div>This incident is minor. But it portends a bigger problem: Will everything be suspect? How do you prove something <i>was not produced by CHAT-GPT?</i> For some things that might not matter, but for testimonials it matters that it's from a human being. For what other writings is it important that they came from a human being? Here are some examples and counterexamples and questions</div><div><br /></div><div>1) A witness to a crime has his written statement done by CHAT-GPT. IF its just helping him write up what he really saw, thats fine(?). IAMNAL (I am not a lawyer)</div><div><br /></div><div>2) You writes a novel but its later found out that its by CHAT-GPT. IF you are up front about this on the cover of the book AND the novel is good, I see no problem with this. But what about the other way around- it really IS written by you but nobody believes you. And if nobody cares then it will be</div><div>even harder to convince people that it was written by you. Imagine the following:</div><div><br /></div><div>AUDIENCE: The novel was clearly written by a CHAT-GPT, but that's fine since it was a great novel and you provided the input.</div><div><br />YOU: No, It really was written by me.</div><div><br /></div><div>AUDIENCE: (annoyed) whatever you say. </div><div><br /></div><div>3) When a celebrity writes a book we just assume it was ghostwritten (I do anyway). And I don't care--- all I care about is if the book is good or bad. But ghostwriters cost money. CHAT-GPT will allow us all to have ghostwriters. But I am thinking of the other direction: If a writer (celeb or not) actually writes a book without a ghostwriter or CHAT-GPT, it would be hard to convince us of that. </div><div><br /></div><div>4) I wonder if the number of times it matters that it was no CHAT-GPT is small and getting smaller. </div>https://blog.computationalcomplexity.org/2023/07/another-problem-with-chatgpt.htmlnoreply@blogger.com (gasarch)3tag:blogger.com,1999:blog-3722233.post-288767409665688048Wed, 26 Jul 2023 19:10:00 +00002023-07-26T14:10:35.705-05:00Paper Writing Before Overleaf<p> A <a href="https://twitter.com/vanessainstem/status/1683183182303358976">twitter question</a> from a young researcher.</p>
<blockquote class="twitter-tweet"><p dir="ltr" lang="en">Wait, how do paper writing collaborations work with LaTeX that doesn’t use overleaf? You need more than a .Tex file, right? Do you send the updates? <br /><br />Wait, how did collaborative paper writing work before computers? Or even before commenting options in Microsoft word/Google docs? <a href="https://t.co/ta7OOlqNuU">https://t.co/ta7OOlqNuU</a></p>— Vanessa Sun 😷 (@vanessainstem) <a href="https://twitter.com/vanessainstem/status/1683183182303358976?ref_src=twsrc%5Etfw">July 23, 2023</a></blockquote> <script async="" charset="utf-8" src="https://platform.twitter.com/widgets.js"></script><div>Reminds me of the time one of my children asked me how I drove places before GPS.</div><div><br /></div>I'm not old enough to remember paper writing before computers. Collaboration mostly happened when people were in the same physical location. There were more single-authored and single-institution papers back then. You'd often work on a writeup when you were at the same conference, or even travel just to finish up a paper. <div><br /></div><div>By the late 80's people started to get comfortable sending latex files by email. BibTeX wasn't popular yet so LaTeX files tended to be self-contained. Mail back then added a ">" in front of any line beginning with "From" so you'd often see "¿From" in papers from that time.</div><div><br /></div><div>We'd just take turns working on the paper. If we were really sophisticated, we'd work on different sections at the same time using a master file with \include statements. We added notes directly into the latex using comment lines beginning with %LANCE: Fix this!</div><div><br /></div><div>Oh, and before GPS I used a physical map to get around that I kept in the car. The biggest challenge was folding the map back up afterwards. My kids didn't believe me.</div>https://blog.computationalcomplexity.org/2023/07/paper-writing-before-overleaf.htmlnoreply@blogger.com (Lance Fortnow)13tag:blogger.com,1999:blog-3722233.post-8631662435869925941Sun, 23 Jul 2023 03:13:00 +00002023-07-22T22:13:15.830-05:00"Never give AI the Nuclear Codes" Really? Have you seen Dr. Strangelove?<p>(I covered a simlar topic <a href="https://blog.computationalcomplexity.org/2020/07/do-computers-make-us-more-safe-or-less.html">here</a>.) </p><p> In the June 2023 issue of <i>The Atlantic</i> is an article titled:</p><p> <b>Never Give AI Intelligence the Nuclear Codes</b></p><p><b> by Ross Andersen</b></p><p><b>(This might be a link to it: <a href="https://www.theatlantic.com/magazine/archive/2023/06/ai-warfare-nuclear-weapons-strike/673780/">here</a>. Might be behind a pay wall.) </b></p><p>As you can tell from the title they are against having AI able to launch nuclear weapons. </p><p>I've read similar things elsewhere. </p><p>There is a notion that PEOPLE will be BETTER able to discern when a nuclear strike is needed (and, more importantly, NOT needed) then an AI. Consider the following two scenarios:</p><p>1) An AI has the launch codes and thinks a nuclear strike is appropriate (but is wrong). It does so and there is no overide for a human to intervene. </p><p>2) A Human knows in his gut (and some of what he sees) that a nuclear attack is needed. The AI says NO ITS NOT (The AI knows A LOT more than the human and is correct). The human overides the AI (pulls out the plug?) and launches the attack. </p><p>Frankly I think (2) is more likely than (1). Perhaps there should be a mechanism so that BOTH the AI and the Human have to agree. Of course, both AI's and Humans are clever and may find a way to overide. </p><p>Why do people think that (1) is more likely than (2)? Because they haven't seen the movie Dr. Strangelove. They should!</p>https://blog.computationalcomplexity.org/2023/07/never-give-ai-nuclear-codes-really-have.htmlnoreply@blogger.com (gasarch)13tag:blogger.com,1999:blog-3722233.post-6050840495316223506Wed, 19 Jul 2023 13:46:00 +00002023-07-19T14:30:19.124-05:00More on Pseudodeterminism<p>Back in May I <a href="https://blog.computationalcomplexity.org/2023/05/finding-primes-pseudodeterministically.html">posted</a> about a <a href="https://eccc.weizmann.ac.il/report/2023/076/">paper</a> that finds primes pseudodeterministically and Quanta magazine recently <a href="https://www.quantamagazine.org/how-to-build-a-big-prime-number-20230713/">published a story</a> on the result. Oddly enough the paper really isn't about primes at all.</p><p>Consider any set A such that </p><p></p><ol style="text-align: left;"><li>A is easy to compute, i.e., A is in P.</li><li>A is very large, that is there is a c such that for all n, the number of strings of length n is at least 2<sup>n</sup>/n<sup>c</sup>. If you throw a polynomial number of darts you are very likely to hit A.</li></ol><div>Chen et al show that for any such A, there is a probabilistic polynomial time Turing machine M such that for infinitely many x in A, M on input 1<sup>|x|</sup> will output x with high probability. </div><div><br /></div><div>The set of primes has property 1 by <a href="https://doi.org/10.4007/annals.2004.160.781">Agrawal, Kayal and Saxena</a> and property 2 by the <a href="https://en.wikipedia.org/wiki/Prime_number_theorem">prime number theorem</a>. Why focus the paper on primes though? Because deterministic prime number finding is a <a href="https://polymathprojects.org/2009/07/27/proposal-deterministic-way-to-find-primes/">long-standing open problem</a> and there aren't many other natural problems that have properties 1 and 2 where we don't know easy deterministic algorithms to find examples.</div><div><br /></div><div>With the general result, we can think about oracle results. It's pretty easy to create an A, such that A has property 2 and no deterministic polynomial-time algorithm with oracle access to A can find an element of length n on input 1<sup>n</sup> for infinitely many n. Since A is always in P<sup>A</sup> we get property 1 for free. That would suggest to push the result to finding primes deterministically would require using properties of the primes beyond being large and easy. </div><div><br /></div><div>Maybe not. Rahul Santhanam, one of the authors, tells me their proof doesn't relativize, though whether the result relativizes is an open question, i.e. whether there is an A fulfilling property 2 such that any pseudodeterministic algorithm with oracle access to A will fail to find more than a finite number of elements of A. It does seem hard to construct this oracle, even if we just want the pseudodeterministic algorithms to fail for infinitely many n. </div><div><br /></div><div>Nevertheless it seems unlikely you'd be able to use these techniques to prove a deterministic algorithm for all large easy A. If you want to find primes deterministically you'll probably need some to prove some new number theory. </div><p></p>https://blog.computationalcomplexity.org/2023/07/more-on-psuedodeterminism.htmlnoreply@blogger.com (Lance Fortnow)10tag:blogger.com,1999:blog-3722233.post-7106616561756927969Mon, 17 Jul 2023 04:35:00 +00002023-07-17T10:08:07.449-05:00Finding and answer to a math question: 1983 vs 2023.<p>In 1983, as a grad student, I knew that HALT \( \le_T \) KOLG but didn't know how to prove it. I asked around and A MONTH later through a series of connections I got the proof from Peter Gacs.</p><p> See <a href="https://blog.computationalcomplexity.org/2010/11/non-rigorous-proof-technique.html">here</a> for the full story and see <a href="https://www.cs.umd.edu/~gasarch/TOPICS/mathnotes/easykolm.pdf">here</a> for a write up of the proof<br /></p><p>In 2023, as professor, I heard about a pennies-on-a-chessboard problem and wanted to know what was known about it. I blogged about it and AN HOUR later I found what I wanted. </p><p>See <a href="https://blog.computationalcomplexity.org/2023/06/can-you-put-n-pennies-on-n-x-n.html">here</a> for my blog post asking about and see <a href="https://www.cs.umd.edu/~gasarch/BLOGPAPERS/pennychess.pdf">here</a> for my write up of all that's known. </p><p>Why the difference from a MONTH to an HOUR. </p><p>1) In 1983 there was no Google. I don't recall if there were other search engines, but even if there were there wasn't much to search. I do note that in 2023 Googling did not help me, though it may have helped my readers who pointed me to the information I wanted. </p><p>2) In 1983 email wasn't even that common. So the notion of <i>just email such-and-such for the answer </i>did not occur to me. (Also note that I am a last-blocker, see <a href="https://blog.computationalcomplexity.org/2009/07/are-you-firstblocker-or-lastblocker.html">here</a>.) </p><p>3) Here is a factor that should have been in my favor: the community of theorists was smaller so we kind of knew each other and knew who was doing what. AH- but who is this <i>we ? </i>I started at Harvard in 1980 but really only began doing theory in 1981 and didn't really know the players yet. However, I think the smallness of the community DID help Mihai Gereb (a grad student at Harvard) to know to contact Peter Gacs to help me find the proof. Contrast- today the community is so large that I might not know the players (I didn't for the penny-chess problem) though with email and the blog (next item) I can reach out to people who Do know the players.</p><p>4) The Blog- I have the ability to ASK several people at one time, and one of them might know. That worked in this case and in other cases, but it does not always work. </p><p>5) People without a blog can do something close to what I did- ask several people. And that can be more targeted. (ADDED LATER- a commenter pointed out that I should point out that Math Overflow and Stack exchange and sites like that are also options. Often when I Google a question I have been taken to those sites. I have had less luck asking them directly, but that could just be me.) </p><p>QUESTION: Is it easier to find things out NOW or 40 years ago? I think NOW by far, but I do see some possibly counterarguments. There is a balance- there were less places to look back then. Indeed, the answer to my question was NOT a journal article or a conference paper, it was another blog.</p><p>Lastly THANKS to my readers for pointing me to the sources I needed! Kudos! </p><p>ADDED LATER -a link to the Erdos-Guy paper that I need to put here to aid one of my comments is <a href="https://users.renyi.hu/~p_erdos/1970-03.pdf">here</a></p><p> <br /></p>https://blog.computationalcomplexity.org/2023/07/finding-and-answer-to-math-question.htmlnoreply@blogger.com (gasarch)10tag:blogger.com,1999:blog-3722233.post-906256538559667510Thu, 13 Jul 2023 14:34:00 +00002023-07-13T09:34:27.281-05:00Whither Twitter<p></p><div class="separator" style="clear: both; text-align: center;"><a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjNmco3bkDg13XIH_u8ia6LI66aq9qtOYEJqyoZRe4em6Lus5iLfUrZjBOJ9xv1cOh4yKa7NA-2zrMcCdtjxlotfo7_oCztWujWzUTkDrMYvEW-EESzU1_W1b3MNVg7bYCtnYte5HyCeF3uuD2iVxd_VSOzLwIFbGJvxDwCX0utTRMLhhsQGmpe/s725/Screenshot%202023-07-13%20083742.png" imageanchor="1" style="clear: right; float: right; margin-bottom: 1em; margin-left: 1em;"><img border="0" data-original-height="462" data-original-width="725" height="204" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjNmco3bkDg13XIH_u8ia6LI66aq9qtOYEJqyoZRe4em6Lus5iLfUrZjBOJ9xv1cOh4yKa7NA-2zrMcCdtjxlotfo7_oCztWujWzUTkDrMYvEW-EESzU1_W1b3MNVg7bYCtnYte5HyCeF3uuD2iVxd_VSOzLwIFbGJvxDwCX0utTRMLhhsQGmpe/s320/Screenshot%202023-07-13%20083742.png" width="320" /></a></div>Twitter tells me it's my twitterversary, 15 years since I first started tweeting. Not sure I'll make it to sweet sixteen.<br /><p></p><p>No longer do tweets show up on this blog page. Twitter can't tell the difference between some AI engine slurping up tweets and their own display widget showing tweets on a weblog. Bill complains that he can no longer follow my Twitter as he refuses to set up an account on the site and you can't read tweets without one. Also I will soon lose access to TweetDeck without paying the $8/month that wouldn't solve the other problems. This is ignoring that fact that since Elon has taken over Twitter, the site has just become far less fun.</p><p>I have accounts on <a href="https://fediscience.org/@fortnow">Mastodon</a> and now <a href="https://www.threads.net/@fortnow">Threads</a>. The two combined have less that 100 followers compared to the 5400 I have on Twitter. Not sure how many of those 5400 are bots or people who no longer read twitter regularly. </p><p>For now my tweets get imported into Mastodon which now appear on this blog page. Eventually once Threads gets proper web support and APIs I expect that will become the new twitter and I'll move there. We'll have to see.</p>https://blog.computationalcomplexity.org/2023/07/whither-twitter.htmlnoreply@blogger.com (Lance Fortnow)4tag:blogger.com,1999:blog-3722233.post-5987708819811245794Mon, 10 Jul 2023 01:45:00 +00002023-07-15T10:19:03.226-05:00A further comment on Chernoff--- and the future of ....Ravi Boppana recently did a guest blog on Chernoff turning 100 for us <a href="https://blog.computationalcomplexity.org/2023/07/chernoff-turns-100.html">here</a>. <div><br /></div><div>Consider this unpublished comment on that post:</div><div> </div><div> --------------------------------------------------<br />As we delve into the depths of Professor Chernoff's impressive centennial celebration, it strikes me that the most astounding aspect isn't the breadth of his influence, but the fact that his eponymous 'Chernoff Bound' remains as relevant today as it was when first conceived in 1952. It's not just a mathematical theorem - it's a testament to the timeless power of innovative thinking and a reminder that truly exceptional ideas can cross boundaries, transcending disciplines and even generations.<br /><br />As statisticians, computer scientists, and mathematicians, we are not just the beneficiaries of Professor Chernoff's scientific legacy; we are the continuation of it. Every time we use Chernoff bounds in our work, we're not merely applying a theorem - we're participating in a story that began over 70 years ago, and will hopefully continue for many more.<br /><br />So, as we say 'Happy 100th Birthday' to Professor Chernoff, let's also raise a toast to his contributions that have shaped our field and will continue to guide future generations. It's a living testament that the bounds of his impact are far from being reached. Here's to a legacy that defies the bounds, much like his own theorem!<br />--------------------------------------------------------<br /></div><div><br /></div><div>This SEEMS like an intelligent comment.</div><div><br /></div><div>This IS an intelligent comment.</div><div><br />(One of the comments on this blog post points out that the ChatGPT comment is INCORRECT. Can a comment be INCORRECT and still INTELLIGENT? I think so if it contributes to the conversation.) </div><div><br /></div><div>Who wrote it? You can probably guess: ChatGPT. Lance asked ChatGPT for a comment and this is what he got. </div><div><br />We have, for many years, often gotten bot-generated posts that pick out a few key words and then have a link to buy something. My favorite was</div><div><br /></div><div> Nice post on P vs NP. For a good deal on tuxedo's click here. </div><div> </div><div>I would like to think it was written by a human who thinks Lance will crack P vs NP and wants him to look good when picking up the Millennium Prize. But of course I doubt that.</div><div><br /></div><div>Of more importance is that the attempts to look like a real post were pathetic and content free. In the future (actually, the future is now) ChatGPT may be used to generate an intelligent comment that has a link in it at the end, or worse, in a place we don't notice. So we will need to be more vigilant. This has not been a problem for us yet, but I suspect it will be. <br /></div><div><br /></div><div><br /></div>https://blog.computationalcomplexity.org/2023/07/a-futher-comment-on-chernoff-and-future.htmlnoreply@blogger.com (gasarch)8tag:blogger.com,1999:blog-3722233.post-4630717708584279519Wed, 05 Jul 2023 13:22:00 +00002023-07-05T08:22:51.736-05:00Automating Mathematicians<p></p><div class="separator" style="clear: both; text-align: center;"><a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgIm7KItvcHPdJXdezQp0rEWvfwe0bZ7J7FMmp-kzZ1BtXfVoByraylPTe3FKIB4Zj50q8-8f_k5d4b3KCXz-xvoXMu9m7WGopw4rqi03VHfz9y7wwER0gwlyWz1h7uiCcgWMvVOiSFPih2QrWYU9OOlHcTk2aD6tYOoYjhJfnR07_ZPF8dKX8Y/s512/4009822080_A%20sleek%20robot%20working%20with%20a%20human%20solving%20a%20mathe_xl-beta-v2-2-2.png" imageanchor="1" style="clear: right; float: right; margin-bottom: 1em; margin-left: 1em;"><img border="0" data-original-height="512" data-original-width="512" height="200" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgIm7KItvcHPdJXdezQp0rEWvfwe0bZ7J7FMmp-kzZ1BtXfVoByraylPTe3FKIB4Zj50q8-8f_k5d4b3KCXz-xvoXMu9m7WGopw4rqi03VHfz9y7wwER0gwlyWz1h7uiCcgWMvVOiSFPih2QrWYU9OOlHcTk2aD6tYOoYjhJfnR07_ZPF8dKX8Y/w200-h200/4009822080_A%20sleek%20robot%20working%20with%20a%20human%20solving%20a%20mathe_xl-beta-v2-2-2.png" width="200" /></a></div>The New York Times published an article with the ominous title <a href="https://www.nytimes.com/2023/07/02/science/ai-mathematics-machine-learning.html?unlocked_article_code=bMnlt7BHcKCu0XGppMjqpWGo0UdcoxZol6miuKtEfGrYAzpt20NQHJxGdz0ShenMEGjNymjTVeo_pY99bVlAcA6EuUTbuCeXDyfRdwZ_oOkM7aD7M8BatZNpnzUre655CPObK43iPKqAN4yHySo7iR9tMRFbqbxT9Tx148mHwPPmFoBxeSHVn4Ms7G7-VyODGE0HLkJuQfey9JoD6rOZLKMOnYWEAvCdX9eNygBeMRwkAUuPVDZN5BxQXC7VATHNdK0jC5SX7ysHzRzR_S1KmKvYtYsWXiFUrmhkr6Kg5pGjEIIqW04ouTu-2hOXXE6FlShTlkjWkjk4ggT07CBVnluD3-hhFimQcA&smid=url-share">A.I. Is Coming for Mathematics, Too</a>. We know by the work of Gödel and Turing that we can't automate mathematics. But can we automate mathematicians? Is AI coming for us?<p></p><p>Reading the article I'm not immediately scared. The focus is on logical systems like like the <a href="https://leanprover.github.io/">Lean theorem prover</a> and SAT solvers. </p><p></p><blockquote>Developed at Microsoft by Leonardo de Moura, a computer scientist now with Amazon, Lean uses automated reasoning, which is powered by what is known as good old-fashioned artificial intelligence, or GOFAI — symbolic A.I., inspired by logic. So far the Lean community has <a href="https://leanprover-community.github.io/sphere-eversion/blueprint/">verified</a> an intriguing theorem about turning a sphere inside out as well as a pivotal theorem in a scheme for unifying mathematical realms, among other gambits.</blockquote><p>So Lean is being used mainly to logically verify known theorems. This could actually make life harder for mathematicians, if journals start requiring formal verification for submitted papers.</p><p>I'd love a higher-level AI. One that takes a journal-style proof and verifies it, or even better takes a proof sketch and fills in the details (and <a href="https://blog.computationalcomplexity.org/2023/02/the-virtual-grad-student.html">write it up in LaTeX</a>) . In other words, let me think of high level ideas and leave the messiness to AI. </p><p>I'm won't be holding my breath. Right now, generative AI has limits in its ability to reason, and reasoning is at the heart of mathematics. </p><p>On the other hand, AI now plays a mean game of chess and go, which we also think of reasoning. So maybe automating mathematicians is closer than we think. It might go further and start suggesting new theorems and proving them on their own.</p><p>Ultimately like most other fields AI won't eliminate the need for mathematicians. But like nearly every career moving forward, those who will succeed will not be the ones that push back on AI but those who work smarter and harder to use AI as a tool to do even greater things. Best to think about how to do that now before it's too late.</p><p></p>https://blog.computationalcomplexity.org/2023/07/automating-mathematicians.htmlnoreply@blogger.com (Lance Fortnow)0tag:blogger.com,1999:blog-3722233.post-5591476434600168834Sat, 01 Jul 2023 13:43:00 +00002023-07-01T08:43:23.418-05:00Chernoff Turns 100<p><i></i></p><div style="text-align: right;"><a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiA2JcxW4-aZE9SlE7JJ7iF0RAl0viZDt_ClEeMiL3a7tZ0rmqHYIFcqvV3hnPpH33sucGfBbE7IV3fn9eFY0FlijzsUOQkAsq2zaFqozdMvQMr8T227OMSz1oKTl1Tb0oAmSLIFVeUtRjkVWwdy9wVJrMoutTxay2IK_6OhWq5WNCxQnMt2xMF/s2049/IMG_3798.JPG" style="clear: right; float: right; font-style: italic; margin-bottom: 1em; margin-left: 1em;"><img border="0" data-original-height="2049" data-original-width="1536" height="320" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiA2JcxW4-aZE9SlE7JJ7iF0RAl0viZDt_ClEeMiL3a7tZ0rmqHYIFcqvV3hnPpH33sucGfBbE7IV3fn9eFY0FlijzsUOQkAsq2zaFqozdMvQMr8T227OMSz1oKTl1Tb0oAmSLIFVeUtRjkVWwdy9wVJrMoutTxay2IK_6OhWq5WNCxQnMt2xMF/s320/IMG_3798.JPG" width="240" /></a></div><i>Guest post by Ravi Boppana</i><p></p><p><a href="https://en.wikipedia.org/wiki/Herman_Chernoff">Herman
Chernoff</a> celebrates a milestone today: he turns 100
years old. </p><p class="MsoNormal"><o:p></o:p></p>
<p class="MsoNormal">We in theoretical computer science know Professor Chernoff
primarily for his ubiquitous <a href="https://en.wikipedia.org/wiki/Chernoff_bound">Chernoff bounds</a>.
The Chernoff bound is an exponentially small upper bound on the tail of a
random variable, in terms of its <a href="https://en.wikipedia.org/wiki/Moment-generating_function">moment
generating function</a>. This bound is particularly useful for the sum of
independent random variables. <o:p></o:p></p>
<p class="MsoNormal">Many, many results in theoretical computer science use
Chernoff bounds. For one set of examples, Chernoff bounds are employed in
the analysis of algorithms such as <a href="https://en.wikipedia.org/wiki/Quicksort">Quicksort</a>, <a href="https://en.wikipedia.org/wiki/Linear_probing">linear probing</a> in
hashing, <a href="https://en.wikipedia.org/wiki/MinHash">MinHash</a>, and
a randomized algorithm for <a href="https://en.wikipedia.org/wiki/Set_balancing">set balancing</a>. For
another example, Chernoff bounds are used to reduce the error probability in
complexity classes such as <a href="https://en.wikipedia.org/wiki/BPP_(complexity)">BPP</a>. These
examples merely scratch the surface of the wide-ranging impact that Chernoff
bounds have had. <o:p></o:p></p>
<p class="MsoNormal">Professor Chernoff introduced the Chernoff bound in
his <a href="https://projecteuclid.org/journals/annals-of-mathematical-statistics/volume-23/issue-4/A-Measure-of-Asymptotic-Efficiency-for-Tests-of-a-Hypothesis/10.1214/aoms/1177729330.full">seminal
paper from 1952</a>. Chernoff <a href="https://projecteuclid.org/journals/statistical-science/volume-11/issue-4/A-conversation-with-Herman-Chernoff/10.1214/ss/1032280306.full">credits</a> another
Herman (Herman Rubin) for the elegant proof of the bound in this paper.
Similar bounds had been established earlier by <a href="https://en.wikipedia.org/wiki/Bernstein_inequalities_(probability_theory)">Bernstein</a> and
by <a href="https://en.wikipedia.org/wiki/Cram%C3%A9r%27s_theorem_(large_deviations)">Cramér</a>. <o:p></o:p></p>
<p class="MsoNormal">In his distinguished career, Chernoff was a professor for
decades at Stanford, MIT, and ultimately Harvard. In May, Harvard proudly
hosted a <a href="https://catalyst.harvard.edu/calendar/event/symposium-herman-chernoffs-centennial-celebration-may-5/">symposium</a> in
honor of Professor Chernoff's centenary, which he attended. <o:p></o:p>The photo above shows him at the symposium, looking as cheerful as ever (photo credit: <a href="https://www.urmc.rochester.edu/biostat/people/faculty/thurston.aspx">Professor Sally Thurston</a>). </p>
<p class="MsoNormal">Beyond his remarkable research accomplishments,
Professor Chernoff has passionately guided an entire generation of exceptional
statisticians. According to the <a href="https://www.genealogy.math.ndsu.nodak.edu/id.php?id=14275">Mathematical
Genealogy Project</a>, he has advised 26 PhD students, leading to a lineage of
288 mathematical descendants. Chernoff himself earned his PhD at Brown
University in 1948 under the supervision of <a href="https://en.wikipedia.org/wiki/Abraham_Wald">Abraham Wald</a>. <o:p></o:p></p>
<p class="MsoNormal">Professor Chernoff and his wife, Judy Chernoff, have
been <a href="https://news.harvard.edu/gazette/story/2021/04/after-73-years-of-marriage-their-advice-remains-the-same/">married
for more than 75 years</a>. A <a href="https://www.wcvb.com/article/meet-husband-wife-believed-to-be-oldest-living-couple-in-massachusetts/35857262">Boston
TV news story</a> said that the Chernoffs are believed to be the oldest
living couple in Massachusetts. At the symposium in May, Professor
Chernoff doubted the claim, though he had previously acknowledged that it <a href="https://news.harvard.edu/gazette/story/2021/04/after-73-years-of-marriage-their-advice-remains-the-same/">might
be true</a>. Maybe his cherished field of statistics can be used to
estimate the likelihood of the claim. <o:p></o:p></p>
<p class="MsoNormal">On this extraordinary milestone day, we extend our heartfelt
congratulations and warmest wishes to Professor Chernoff. Happy 100th
birthday, Professor Chernoff! Mazel tov. </p>https://blog.computationalcomplexity.org/2023/07/chernoff-turns-100.htmlnoreply@blogger.com (Lance Fortnow)0tag:blogger.com,1999:blog-3722233.post-9038733708392236603Sat, 24 Jun 2023 14:35:00 +00002023-06-26T19:04:49.704-05:00Can you put n pennies on an n x n chessboard so that all of the distances are distinct/how to look that up? <p> In Jan 2023 I went to the Joint Math Meeting of the AMS and the MAA and took notes on things to look up later. In one of the talks they discussed a problem and indicated that the answer was known, but did not give a reference or a proof. I emailed the authors and got no response. I tried to search the web but could not find it. SO I use this blog post to see if someone either knows the reference or can solve it outright, and either leave the answer in the comments, point to a paper that has the answer in the comments, or email me personally. </p><p>--------------------------------------------------------------------</p><p>A chessboard has squares that are 1 by 1. </p><p>Pennies have diameter 1.</p><p>QUESTION: </p><p>For which n is there a way to place n pennies on squares of the n x n chessboard so that all of the distances between centers of the pennies are DIFFERENT?</p><p>-----------------------------------------------------------</p><p>I have figured out that you CAN do this for n=3,4,5. I THINK the talk said it cannot be done for n=6. If you know or find a proof or disproof then please tell me. I am looking for human-readable proofs, not computer proofs. Similar for higher n.</p><p>I have a writeup of the n=3,4,5 cases <a href="https://www.cs.umd.edu/~gasarch/BLOGPAPERS/pennychess.pdf">here</a> (ADDED LATER- I will edit this later in light of the very interesting comments made on this blog entry.) </p><p>----------------------------------------------------------------------</p><p>With technology and search engines it SHOULD be easier to find out answers to questions then it was in a prior era. And I think it is. But there are times when you are still better off asking someone, or in my case blog about it, to find the answer. Here is hoping it works!</p><p>ADDED LATER: Within 30 minutes of posting this one of my readers wrote a program and found tha tyou CAN do it for n=6 and gives the answer. Another commenter pointed to a website with the related quetion of putting as many pawns as you can on an 8x8 board.</p><p>ADDED LATER: There are now comments on the blog pointing to the FULL SOLUTION to the problem, which one can find <a href="https://oscarcunningham.com/670/unique-distancing-problem/">here</a>. In summary: </p><p>for n=3,...,7 there IS a way to put n pennies on a chessboard such that all distances are distinct.</p><p>for n=8,...,14 a computer search shows that there is no such way.</p><p>for n=15 there is an INTERESTING PROOF that there is no such way (good thing - the computer program had not halted yet. I do not know if it every did.) </p><p>for n\ge 16 there is a NICE proof that there IS such way. </p><p>I am ECSTATIC!- I wanted to know the answer and now I do and its easy to understand!</p><p><br /></p>https://blog.computationalcomplexity.org/2023/06/can-you-put-n-pennies-on-n-x-n.htmlnoreply@blogger.com (gasarch)10tag:blogger.com,1999:blog-3722233.post-1971310189381809136Thu, 22 Jun 2023 17:15:00 +00002023-06-22T12:15:59.343-05:00Don't Negotiate with Logic<p>Computer science and mathematicians often try to use logic to negotiate whether it be at a university or life in general. I've tried it myself and it doesn't usually work. Even if you have that (rare) perfect argument, remember <a href="https://www.goodreads.com/quotes/21810-it-is-difficult-to-get-a-man-to-understand-something">Upton Sinclair's words</a>: <i>It is difficult to get a man to understand something, when his salary depends on his not understanding it</i>.</p><p>So make sure their salary depends on them understanding it. Or more to the point, in a world with limited resources, why it makes sense for them to help you. </p><ol style="text-align: left;"><li>Ideally go for the win-win. Why a certain decision helps the department/college/university as well as yourself. Asking for a small investment as a seed towards a large grant for example.</li><li>How would the decision make you or your students more successful? The success of a department is measured by the success of the faculty and students. On the other hand, why would a different decision hold you and your students back.</li></ol><div>Even outside the university, make your objectives in line with the objectives of the person you are negotiating with to lead to a better outcome.</div><div><br /></div><div>Of course sometimes you are haggling over a price or a salary when it really is a zero-sum game. There it's good to know the <a href="https://www.investopedia.com/terms/b/best-alternative-to-a-negotiated-agreement-batna.asp">BATNA</a>, Best Alternative To a Negotiated Agreement, for yourself and the other entity. In other words, if they aren't selling to you what other options do you and they have?</div><div><br /></div><div>There are whole books written about negotiating strategies. Mostly it comes down to making it work for both parties. That's what matters, not the logic.</div><p></p>https://blog.computationalcomplexity.org/2023/06/dont-negotiate-with-logic.htmlnoreply@blogger.com (Lance Fortnow)2