DeepAI AI Chat
Log In Sign Up

Formalizing computability theory via partial recursive functions

10/19/2018
by   Mario Carneiro, et al.
Carnegie Mellon University
0

We present a formalization of the foundations of computability theory in the Lean theorem prover. We use primitive recursive functions and partial recursive functions as the main objects of study, including the construction of a universal partial recursive function and a proof of the undecidability of the halting problem. Type class inference provides a transparent way to supply Gödel numberings where needed and encapsulate the encoding details.

READ FULL TEXT

page 1

page 2

page 3

page 4

11/15/2018

Axiomatic approach to the theory of algorithms and relativized computability

It is well known that many theorems in recursion theory can be "relativi...
08/14/2019

Pointers in Recursion: Exploring the Tropics

We translate the usual class of partial/primitive recursive functions to...
07/01/2019

On Rudimentarity, Primitive Recursivity and Representability

It is quite well-known from Kurt Gödel's (1931) ground-breaking result o...
03/10/2020

Hilbert's Tenth Problem in Coq

We formalise the undecidability of solvability of Diophantine equations,...
01/09/2020

Monotone recursive types and recursive data representations in Cedille

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

Primitive Recursive Ordered Fields and Some Applications

We establish primitive recursive versions of some known facts about comp...
02/04/2021

Formalising a Turing-Complete Choreographic Language in Coq

Theory of choreographic languages typically includes a number of complex...

Code Repositories

mathlib-CPP2019

mathlib library, prepared for the paper "Formalizing computability theory via partial recursive functions"


view repo