|
|
Vorlesungsverzeichnis >> Technische Fakultät (TF) >>
|
Hilbert's Tenth Problem (HilPro)- Dozent/in
- Dr. Wolfgang Degen
- Angaben
- Vorlesung
2 SWS, benoteter Schein, ECTS-Studium, ECTS-Credits: 2,5, Sprache Englisch
Zeit und Ort: n.V.; Bemerkung zu Zeit und Ort: Lehrstuhl Informatik 10, Cauerstraße 6
Vorbesprechung: 19.10.2010, 14:00 - 15:00 Uhr, Raum 0.141
- Studienfächer / Studienrichtungen
- WPF INF-DH-SIM ab 4 (ECTS-Credits: 5)
WPF INF-BA-V-THI ab 4 (ECTS-Credits: 5)
WPF INF-BA-W ab 5
WPF INF-BA-S ab 4
- Inhalt
- This Problem (H10P) is one of the famous 23 problems Hilbert formulated in Paris in 1900. After the efforts of several logicians and mathematicians Yuri Matiyasevic solved this problem in 1970.
What is H10P? It asked whether there is an algorithm A such that given a polynomial with integer coefficients, A decides whether this polynomial has zeros in the integers or not.Matiyasevic answered this question in the negative. This negative answer follows from the following stronger assertion:
(1) Every recursively enumerable set is diophantine.
The lecture / seminar will develop the two disciplines that are alluded to in (1), namely the theory of computation and number theory.
A certificate for a seminar can be acquired either by giving a talk or by solving a set of exercises.
- Empfohlene Literatur
- [1] Davis : Computability and Unsolvability (Second Edition!), Dover,1982
[2] Hardy and Wright : An Introduction to the Theory of Numbers, Oxford 1960 (and later editions)
- ECTS-Informationen:
- Title:
- Hilbert's Tenth Problem
- Credits: 2,5
- Zusätzliche Informationen
- Erwartete Teilnehmerzahl: 10, Maximale Teilnehmerzahl: 10
Für diese Lehrveranstaltung ist eine Anmeldung erforderlich.
Die Anmeldung erfolgt von Montag, 18.10.2010 bis Montag, 1.11.2010 über: mein Campus.
- Verwendung in folgenden UnivIS-Modulen
- Startsemester WS 2010/2011:
- Hilbert's Tenth Problem (HilPro)
- Institution: Lehrstuhl für Informatik 10 (Systemsimulation)
|
 |
|
|
UnivIS ist ein Produkt der Config eG, Buckenhof |
|
|