>>10729408Novel Sieve already solves this. When you can represent memory in math, this is "solvable". Here's a Java Version. This cannot be "proven" in terms of mathematics, because it requires memory, which Math does not account for to our knowledge.
public void make_Sieve() {
int n = 1000; //path length
boolean[] a = new boolean[n]; //each step
int o = 0; //operations count (memory sets)
int p = 0; //location visit count
//the logical path
long startTime = System.currentTimeMillis();
//THE CORE: set path
for (int i=2; i < Math.sqrt(n); i++) {
if (a
== true) {continue;}
for (int j=i+i; j < n; j+=i){
if (a[j] == true) {continue;}
a[j] = true;
o++;
}
p++;
//System.out.println(i);
}
//END CORE
long endTime = System.currentTimeMillis();
long totalTime = endTime - startTime;
System.out.println("Sieve Time: "+totalTime+"ms");
System.out.println("Visits: " + p);
System.out.println("Operations: " + o);
} 
