The Complexity of the Twin Prime Conjecture

EasyChair Preprint 3388

Abstract

Twin primes become increasingly rare as one examines larger ranges, in keeping with the general tendency of gaps between adjacent primes to become larger as the numbers themselves get larger. The question of whether there exist infinitely many twin primes has been one of the great open questions in number theory for many years. We prove the Twin prime conjecture using the Complexity Theory. An important complexity class is 1NSPACE(S(n)) for some S(n). This mathematical proof is based on if some unary language belongs to 1NSPACE(S(log n)), then the binary version of that language belongs to 1NSPACE(S(n)) and vice versa.

Keyphrases: complexity classes, number theory, one-way, primes, reduction, regular languages

@booklet{EasyChair:3388,
  author    = {Frank Vega},
  title     = {The Complexity of the Twin Prime Conjecture},
  howpublished = {EasyChair Preprint 3388},
  year      = {EasyChair, 2020}}