Hilbert's 10th Problem

dc.rights.license	CC-BY-NC-ND
dc.contributor.advisor	van Oosten, Jaap
dc.contributor.author	Dirven, R.A.
dc.date.accessioned	2021-06-18T18:00:17Z
dc.date.available	2021-06-18T18:00:17Z
dc.date.issued	2021
dc.identifier.uri	https://studenttheses.uu.nl/handle/20.500.12932/39579
dc.description.abstract	In 1900 German mathematician David Hilbert published a list of 23 open mathematical problems. Hilbert’s 10th problem asks for an algorithm which determines whether a polynomial with integer coefficients (and an arbitrary amount of variables) has a root in Z. We will explore and explain Matiyasevich’s proof and the necessary theory to understand it. Reading this thesis will guide you through both logic and number theory, with small parts hinting to theoretical computer science.
dc.description.sponsorship	Utrecht University
dc.format.extent	559919
dc.format.mimetype	application/pdf
dc.language.iso	en_US
dc.title	Hilbert's 10th Problem
dc.type.content	Bachelor Thesis
dc.rights.accessrights	Open Access
dc.subject.keywords	Hilbert's 10th Problem, Computability Theory, Diophantine
dc.subject.courseuu	Wiskunde