MoL-2018-14: Computation with Infinite Programs

MoL-2018-14: Lewis, Ethan S. (2018) Computation with Infinite Programs. [Report]

[thumbnail of MoL-2018-14.text.pdf]

Download (506kB) | Preview


Koepke introduced a machine model of computation that uses infinite time and space. In our thesis, we generalize Koepke’s model by allowing for infinite programs in addition to infinite time and space. With this new model of computation, we prove generalizations of basic results from finite computability theory. Furthermore, we introduce the axiom of computable enumerability and show that it is independent of Gödel-Bernays class theory with the axiom of global choice. Assuming this axiom, we prove results that characterize the computably enumerable and decidable classes, as well as the computable functions.

Item Type: Report
Report Nr: MoL-2018-14
Series Name: Master of Logic Thesis (MoL) Series
Year: 2018
Subjects: Computation
Depositing User: Dr Marco Vervoort
Date Deposited: 13 Sep 2018 12:38
Last Modified: 13 Sep 2018 12:38

Actions (login required)

View Item View Item