BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Ashoka University - ECPv6.18.2//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://www.ashoka.edu.in
X-WR-CALDESC:Events for Ashoka University
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20160101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20171010T163000
DTEND;TZID=UTC:20171010T173000
DTSTAMP:20211006T215649Z
CREATED:20211006T215649Z
LAST-MODIFIED:20211006T215649Z
UID:20164-1507653000-1507656600@www.ashoka.edu.in
SUMMARY:Hilbert tenth problem and variations
DESCRIPTION:Abstract: In 1900\, Hilbert posed a famous list of 23 problems\, which shaped the mathematics of the following century. We shall talk about Hilber tenth problem: “Given a Diophantine equation with any number of unknown quantities and with rational integral numerical coefficients: To devise a process according to which it can be determined in a finite number of operations whether the equation is solvable in rational integers.” The problem can be modernized in the following way: Write a program which given as parameter a polynomial P(X1\,…Xn) in multiple variable\, with integers coefficient\, find whether or not P(x1\,…xn)=0 has a solution\, where x1…xn are integers. A lot of work on the subject was done by Martin Davis\, Julia Robinson\, and Hilary Putnam. Finally Yuri Matiyasevich\, in 1970\, did the last step\, proving that there is no solution to Hilbert tenth problem. To be more precise there is no programs that can work for all polynomials. The goal of this talk is to discuss the result and various related problems: Is a similar problem solvable if we want to find a root in the natural numbers? in the rational numbers? or in the real numbers?
URL:https://www.ashoka.edu.in/event/hilbert-tenth-problem-and-variations/
CATEGORIES:Offline
END:VEVENT
END:VCALENDAR