Set Turing Machines
Logic
2021-03-26 v1 Logic in Computer Science
Abstract
We define a generalization of the Turing machine that computes on general sets. Our main theorem states that the class of generalized Turing machine computable functions and the class of Set Recursive functions coincide.
Cite
@article{arxiv.2103.14013,
title = {Set Turing Machines},
author = {Garvin Melles},
journal= {arXiv preprint arXiv:2103.14013},
year = {2021}
}