Pith. sign in

REVIEW 1 cited by

On the complexity of computing prime tables on a Turing machine

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1604.01154 v1 pith:IQDH7FPH submitted 2016-04-05 cs.DS

Igor S. Sergeev This is my paper · ORCID
classification cs.DS
keywords complexitycomputingmachineturingmultitapeprimeprimesprove
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

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)$.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 192 citations worldwide. Full citation record

  1. Faster enumeration of primes

    math.NT 2026-06 unverdicted novelty 8.0 of 10

    New prime enumeration algorithms achieve N (log log N)^{1+o(1)} bit operations in the multitape Turing model, improving prior work by nearly log N via fast polynomial arithmetic over finite fields and error-correcting...

Pith tools