Non-deterministic computation and the Jayne-Rogers Theorem
Logic in Computer Science
2014-04-02 v1 Logic
Abstract
We provide a simple proof of a computable analogue to the Jayne Rogers Theorem from descriptive set theory. The difficulty of the proof is delegated to a simulation result pertaining to non-deterministic type-2 machines. Thus, we demonstrate that developments in computational models can have applications in fields thought to be far removed from it.
Cite
@article{arxiv.1404.0079,
title = {Non-deterministic computation and the Jayne-Rogers Theorem},
author = {Arno Pauly and Matthew de Brecht},
journal= {arXiv preprint arXiv:1404.0079},
year = {2014}
}
Comments
In Proceedings DCM 2012, arXiv:1403.7579