Mechanised Computability Theory
-
Altmetric Citations
Description
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,
Collections | ANU Research Publications |
---|---|
Date published: | 2011 |
Type: | Conference paper |
URI: | http://hdl.handle.net/1885/36846 |
Source: | Mechanised Computability Theory |
DOI: | 10.1007/978-3-642-22863-6_22 |
Download
File | Description | Size | Format | Image |
---|---|---|---|---|
01_Norrish_Mechanised_Computability_2011.pdf | 272.33 kB | Adobe PDF | Request a copy |
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.
Updated: 17 November 2022/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator