On Polynomial Time Computable Numbers
Computational Complexity
2007-05-23 v1
Abstract
It will be shown that the polynomial time computable numbers form a field, and especially an algebraically closed field.
Cite
@article{arxiv.cs/0608067,
title = {On Polynomial Time Computable Numbers},
author = {Tetsushi Matsui},
journal= {arXiv preprint arXiv:cs/0608067},
year = {2007}
}
Comments
19 pages