Omnimaga
General Discussion => Technology and Development => Computer Programming => Topic started by: ruler501 on February 25, 2011, 08:41:36 pm
-
If you do not know about this there is a website here: http://www.geneticprogramming.us/
I am trying to learn genetic programming/create a new library for it in python.
I thought this would be a good place to create a discussion on it and possible implementations and uses. Please post any thoughts you have on the subject
-
I like how it essentially randomly chooses stuff, so you can give criteria even though you don't fully know where it's gonna go.
-
The only problem is that it'll take a supercomputer a week to solve even a simple problem with genetic programming :P
-
You can get it working well. I believe there are efficient algorithms that will make it in python take less than a minute on an average computer
-
Depends on the problem. Genetic programming is a method that inherently relies on randomness, so it will only converge to a solution (if it can find one) with quite a bit of time. It's definitely more inefficient than most analytical algorithms.
-
It can be applied for certain things to work better. I found some good uses for this.
Is there a better way to find polynomial approximations for functions?
-
Gaussian Quadrature is an excellent method of approximating functions.