BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Nancy Abigail Nuñez (Universidad Nacional Autónoma de México)
DTSTART:20261210T190000Z
DTEND:20261210T200000Z
DTSTAMP:20261117T010915Z
UID:OLS/225
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/OLS/225/">Ma
 thematical proofs\, computational complexity and AI</a>\nby Nancy Abigail 
 Nuñez (Universidad Nacional Autónoma de México) as part of Online logic
  seminar\n\nInteractive livestream: https://zoom.us/j/122323340\n\nAbstrac
 t\nMathematical proofs are a crucial aspect of mathematicians' work and\, 
 in many cases\, finding or discovering a proof is quite challenging. Findi
 ng the proof of certain mathematical theorems\, such as Fermat's Last Theo
 rem or the Four Color Theorem\, required decades or even centuries\, which
  attests to the difficulty of establishing the truth of some mathematical 
 statements. Nevertheless\, the rapid progress of artificial intelligence c
 urrently suggests that\, in the near future\, it will be possible to autom
 ate the discovery of mathematical proofs\; that is\, that artificial intel
 ligence will be able to prove mathematical theorems. This talk critically 
 examines the viability of relying on artificial intelligence to fully auto
 mate the discovery of mathematical proofs\, in light of certain results fr
 om computational complexity theory. Without disregarding the recent advanc
 es achieved by artificial intelligence in this area (such as the solution 
 announced by OpenAI to the Navier–Stokes problem)\, this talk seeks to t
 emper the expectations placed on this technology to fully replace human re
 asoning in the discovery of mathematical proofs\, since the complexity of 
 this task defies automation. The hypothesis of this talk is that\, because
  of the complexity inherent in discovering or searching for mathematical p
 roofs\, a broad class of problems may not be amenable to automation by art
 ificial intelligence\, automated theorem provers\, or proof assistants.\n
LOCATION:https://researchseminars.org/talk/OLS/225/
URL:https://zoom.us/j/122323340
END:VEVENT
END:VCALENDAR
