Towards a Church-Turing-Thesis for Infinitary Computations
Logic
2013-07-26 v1
Abstract
We consider the question whether there is an infinitary analogue of the Church-Turing-thesis. To this end, we argue that there is an intuitive notion of transfinite computability and build a canonical model, called Idealized Agent Machines (s) of this which will turn out to be equivalent in strength to the Ordinal Turing Machines defined by P. Koepke.
Cite
@article{arxiv.1307.6599,
title = {Towards a Church-Turing-Thesis for Infinitary Computations},
author = {Merlin Carl},
journal= {arXiv preprint arXiv:1307.6599},
year = {2013}
}