<html><head><meta http-equiv="content-type" content="text/html; charset=us-ascii"></head><body dir="auto"><p class="MsoNormal" style="-webkit-text-size-adjust: auto; margin: 0in; font-family: Aptos, sans-serif; font-size: 10pt;"><span style="font-family: Helvetica; font-size: 14pt;"><b>Marco Carmosino</b></span></p><p class="MsoNormal" style="-webkit-text-size-adjust: auto; margin: 0in; font-family: Aptos, sans-serif; font-size: 10pt;"><span style="font-family: Helvetica; font-size: 14pt;"><b>International Business Machines (IBM)</b></span></p><p class="MsoNormal" style="-webkit-text-size-adjust: auto; margin: 0in; font-family: Aptos, sans-serif; font-size: 10pt;"><span style="font-family: Calibri, sans-serif;"> </span></p><p class="MsoNormal" style="-webkit-text-size-adjust: auto; margin: 0in; font-family: Aptos, sans-serif; font-size: 10pt;"><span style="font-size: 12pt;"><img src="cid:B6B7854A-E20C-446A-B8E9-AF7C50C1DBCF" id="Picture_x0020_1" width="388" height="285" alt="image001.png" style="width: 4.052in; height: 2.9791in; margin-top: 0px; margin-bottom: 0px;"></span></p><p class="MsoNormal" style="-webkit-text-size-adjust: auto; margin: 0in; font-family: Aptos, sans-serif; font-size: 10pt;"><span style="font-family: Calibri, sans-serif; font-size: 11pt;"> </span><span style="font-family: Calibri, sans-serif;"> </span></p><p class="MsoNormal" style="-webkit-text-size-adjust: auto; margin: 0in; font-family: Aptos, sans-serif; font-size: 10pt;"><span style="font-family: Calibri, sans-serif; font-size: 11pt;"><b><span dir="ltr">Tuesday, November 11, 202</span></b></span><span style="font-family: Calibri, sans-serif; font-size: 11pt;"><b><span dir="ltr">5,</span></b></span><span style="font-family: Calibri, sans-serif; font-size: 11pt;"><b><span dir="ltr"> at 3:30pm</span></b></span></p><p class="MsoNormal" style="-webkit-text-size-adjust: auto; margin: 0in; font-family: Aptos, sans-serif; font-size: 10pt;"><span style="font-family: Calibri, sans-serif; font-size: 11pt; background-color: yellow;"><b>Kent Chemical Laboratory, Room 102</b></span></p><p class="MsoNormal" style="-webkit-text-size-adjust: auto; margin: 0in; font-family: Aptos, sans-serif; font-size: 10pt;"><span style="font-family: Calibri, sans-serif; font-size: 11pt;"> </span></p><p class="MsoNormal" style="-webkit-text-size-adjust: auto; margin: 0in; font-family: Aptos, sans-serif; font-size: 10pt;"><span style="font-family: Calibri, sans-serif; font-size: 11pt;"> </span></p><p class="MsoNormal" style="-webkit-text-size-adjust: auto; margin: 0in; font-family: Aptos, sans-serif; font-size: 10pt;"><span style="font-family: Calibri, sans-serif; font-size: 12pt;"> </span></p><p class="MsoNormal" style="-webkit-text-size-adjust: auto; margin: 0in; font-family: Aptos, sans-serif; font-size: 10pt;"><span style="font-size: 12pt; background-color: white;"><b><i>Title: </i></b></span><span style="font-size: 12pt; color: rgb(33, 33, 33);">Constructive Complexity Theory</span></p><p class="MsoNormal" style="-webkit-text-size-adjust: auto; margin: 0in; font-family: Aptos, sans-serif; font-size: 10pt;"><span style="font-size: 12pt;"> </span></p><p class="MsoNormal" style="-webkit-text-size-adjust: auto; background-color: white; margin: 0in; font-family: Aptos, sans-serif; font-size: 10pt;"><span style="font-size: 12pt;"><b><i> </i></b></span></p><p class="MsoNormal" style="-webkit-text-size-adjust: auto; background-color: white; margin: 0in; font-family: Aptos, sans-serif; font-size: 10pt;"><span style="font-size: 12pt;"><b><i>Abstract: </i></b></span><span style="font-size: 12pt; color: rgb(33, 33, 33);">Why do the main questions of complexity theory remain open after decades of intensive research? This talk surveys exciting new results and tools that are beginning to explain the inherent difficulty of open questions in complexity theory. We formulate complexity theory as a collection of computational problems, and explore the inherent difficulty of designing efficient algorithms to solve these problems. Surprisingly, "algorithmic" solutions to major open problems in complexity (including P vs. NP) are necessarily algorithmic.</span></p><div dir="ltr"></div></body></html>