DeepAI AI Chat
Log In Sign Up

Hilbert's Tenth Problem in Coq

We formalise the undecidability of solvability of Diophantine equations, i.e. polynomial equations over natural numbers, in Coq's constructive type theory. To do so, we give the first full mechanisation of the Davis-Putnam-Robinson-Matiyasevich theorem, stating that every recursively enumerable problem – in our case by a Minsky machine – is Diophantine. We obtain an elegant and comprehensible proof by using a synthetic approach to computability and by introducing Conway's FRACTRAN language as intermediate layer. Additionally, we prove the reverse direction and show that every Diophantine relation is recognisable by μ-recursive functions and give a certified compiler from μ-recursive functions to Minsky machines.


page 1

page 2

page 3

page 4


Formalizing computability theory via partial recursive functions

We present a formalization of the foundations of computability theory in...

A proof of Hilbert's theorem on ternary quartic forms with the ladder technique

This paper proposes a totally constructive approach for the proof of Hil...

A recursion theoretic foundation of computation over real numbers

We define a class of computable functions over real numbers using functi...

An Analysis of Tennenbaum's Theorem in Constructive Type Theory

Tennenbaum's theorem states that the only countable model of Peano arith...

Monotone recursive types and recursive data representations in Cedille

Guided by Tarksi's fixpoint theorem in order theory, we show how to deri...

Extended Addressing Machines for PCF, with Explicit Substitutions

Addressing machines have been introduced as a formalism to construct mod...

Axiomatic approach to the theory of algorithms and relativized computability

It is well known that many theorems in recursion theory can be "relativi...