An epsilon-delta characterization of a certain TTE computability notion
Logic
2013-01-16 v4
Abstract
The TTE computability notion in effective metric spaces is usually defined by using Cauchy representations. Under some weak assumptions, we characterize this notion in a way which avoids using the representations.
Keywords
Cite
@article{arxiv.1207.7270,
title = {An epsilon-delta characterization of a certain TTE computability notion},
author = {Dimiter Skordev},
journal= {arXiv preprint arXiv:1207.7270},
year = {2013}
}
Comments
10 pages (A typo corrected on page 8, line 2 from above, of the previous version)