On the complexity of computing prime tables on a Turing machine
Data Structures and Algorithms
2016-04-06 v1
Abstract
We prove that the complexity of computing the table of primes between and on a multitape Turing machine is .
Cite
@article{arxiv.1604.01154,
title = {On the complexity of computing prime tables on a Turing machine},
author = {Igor S. Sergeev},
journal= {arXiv preprint arXiv:1604.01154},
year = {2016}
}
Comments
6 pages