Evolving Prime Number Algorithms: Can Computers Duplicate Human Programming?

Click For Summary
SUMMARY

This discussion centers on the evolution of prime number algorithms and the potential for computers to replicate human programming thought processes. It highlights various methods for determining prime numbers, including checking divisibility up to the square root of the number. The conversation also touches on advanced concepts such as genetic programming and meta-learning, suggesting that these areas may provide insights into automating programming evolution. Haskell programming is mentioned as a possible language for implementing these concepts.

PREREQUISITES
  • Understanding of prime number algorithms
  • Familiarity with Haskell programming language
  • Knowledge of genetic programming concepts
  • Basic principles of meta-learning in machine learning
NEXT STEPS
  • Research "Haskell prime number algorithms"
  • Explore "genetic programming techniques"
  • Investigate "meta-learning in machine learning"
  • Study "efficiency of prime number testing algorithms"
USEFUL FOR

Computer scientists, software developers, and researchers interested in algorithm development, machine learning, and programming automation.

shivakumar06
Messages
69
Reaction score
0
there are many prime number algorithm the simplest being dividing all the number less than the prime number. then comes division of number less than or equal half of the number to prime number with the prime number finally the division by all the smaller prime number than the given number with the required number. this is just the the way a program has evolved in the mind of the programmer. can this evolution of programming duplicated by the computer. if only the objective of programme given.(may be in haskell programming i am not sure) if yes by which programming language and the i need the key words that can be used as well
 
Last edited:
Computer science news on Phys.org
there are many prime number algorithm the simplest being dividing all the number less than the prime number. then comes division of number less than or equal half of the number to prime number

Actually, you only need to check possible primes up to the square root of the number you're trying to factor. Going up to half of the number you're trying to factor is overkill.

this is just the the way a program has evolved in the mind of the programmer. can this evolution of programming duplicated by the computer. if only the objective of programme given.(may be in haskell programming i am not sure) if yes by which programming language and the i need the key words that can be used as well

What you're talking about sounds like a cross between genetic programming and metaprogramming. There's been some work done in this area, such as meta-learning for machine learning algorithms, meta-genetic programming, and to a certain extent, machine learning in general. I recommend looking into these fields to start and seeing where that takes you.
 

Similar threads

  • · Replies 28 ·
Replies
28
Views
5K
Replies
5
Views
828
Replies
14
Views
3K
  • · Replies 44 ·
2
Replies
44
Views
6K
Replies
33
Views
5K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 8 ·
Replies
8
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 13 ·
Replies
13
Views
3K