On the complexity of computing prime tables on a Turing machine
  We prove that the complexity of computing the table of primes between $1$ and $n$ on a multitape Turing machine is $O(n \log n)$. 
Igor S. Sergeev
cs.DS