Mechanised Computability Theory
Date
2011
Authors
Norrish, Michael
Journal Title
Journal ISSN
Volume Title
Publisher
Springer
Abstract
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,
Description
Keywords
Keywords: Computability theory; Computational power; Mechanisation; Recursions; Recursively enumerable sets; Universal machines; Calculations; Computability and decidability; Machinery; Mechanization; Problem solving; Recursive functions; User interfaces; Theorem p
Citation
Collections
Source
Mechanised Computability Theory
Type
Conference paper
Book Title
Entity type
Access Statement
License Rights
Restricted until
2037-12-31
Downloads
File
Description