Notice also the decidability of primality in polynomial time, which was proved by some Computer Science graduates (Neeraj Kayal, and Nitin Saxena) in 2011, and

Notice also the decidability of primality in polynomial time, which was proved by some Computer Science graduates (Neeraj Kayal, and Nitin Saxena) in 2011, and led Bombieri (one of the leading experts on Number Theory) to say that Number Theory may have gone astray in theoretical complexity in some fields.