shytiger wrote:My current approach to the primes is algorithmic. I see the Sieve of Eratosthenes as being a recursive algorithm acting on the natural numbers.
Let me give you some advice
, since my formal training was in Computer Science (i.e., centered on the algorithmic approach), and I have traveled this ground. Make sure you don't restrict yourself to just "integer algorithms" (e.g., Diophantine equations), it is important to understand the relationships between integers, primes, and 'non-integers' and 'non primes' thus you should include ideas about general and specific computation (and "the uncomputable") to better characterize the nature of primes.
