Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Mechanised Computability Theory

Date

Authors

Norrish, Michael

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,

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

URI

http://hdl.handle.net/1885/36846

Collections

ANU Research Publications

Source

Mechanised Computability Theory

Type

Conference paper

DOI

10.1007/978-3-642-22863-6_22

Restricted until

2037-12-31

Downloads

File

Description

01_Norrish_Mechanised_Computability_2011.pdf (272.33 KB)