Skip navigation
Skip navigation

Mechanised Computability Theory

Norrish, Michael


This paper presents a mechanisation of some basic computability theory. The mechanisation uses two models: the recursive functions and the λ-calculus, and shows that they have equivalent computational power. Results proved include the Recursion Theorem,

CollectionsANU Research Publications
Date published: 2011
Type: Conference paper
Source: Mechanised Computability Theory
DOI: 10.1007/978-3-642-22863-6_22


File Description SizeFormat Image
01_Norrish_Mechanised_Computability_2011.pdf272.33 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  12 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator