BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://cmsa.fas.harvard.edu
X-WR-CALDESC:Events for CMSA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20201101T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20211107T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20210310T150000
DTEND;TZID=America/New_York:20210310T160000
DTSTAMP:20240517T194750Z
CREATED:20240126T083441Z
LAST-MODIFIED:20240517T194750Z
UID:10001414-1615388400-1615392000@cmsa.fas.harvard.edu
SUMMARY:The Ramanujan Machine: Using Algorithms for the Discovery of Conjectures on Mathematical Constants
DESCRIPTION:Speaker: Ido Kaminer\, Technion – Israel Institute of Technology\, Faculty of Electrical Engineering \nTitle: The Ramanujan Machine: Using Algorithms for the Discovery of Conjectures on Mathematical Constants \nAbstract: In the past\, new conjectures about fundamental constants were discovered sporadically by famous mathematicians such as Newton\, Euler\, Gauss\, and Ramanujan. The talk will present a different approach – a systematic algorithmic approach that discovers new mathematical conjectures on fundamental constants. We call this approach “the Ramanujan Machine”. The algorithms found dozens of well-known formulas as well as previously unknown ones\, such as continued fraction representations of π\, e\, Catalan’s constant\, and values of the Riemann zeta function. Part of the conjectures were in retrospect simple to prove\, whereas others remained so far unproved. We will discuss these puzzles and wider open questions that arose from this algorithmic investigation – specifically\, a newly-discovered algebraic structure that seems to generalize all the known formulas and connect between fundamental constants. We will also discuss two algorithms that proved useful in finding conjectures: a variant of the meet-in-the-middle algorithm and a gradient descent algorithm tailored to the recurrent structure of continued fractions. Both algorithms are based on matching numerical values; consequently\, they conjecture formulas without providing proofs or requiring prior knowledge of the underlying mathematical structure. This way\, our approach reverses the conventional usage of sequential logic in formal proofs; instead\, using numerical data to unveil mathematical structures and provide leads to further mathematical research.
URL:https://cmsa.fas.harvard.edu/event/3-10-2021-new-tech-in-math/
LOCATION:Virtual
CATEGORIES:New Technologies in Mathematics Seminar
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-New-Technologies-in-Mathematics-03.10.21.png
END:VEVENT
END:VCALENDAR