yung23
12-15-06, 04:08 PM
most know my theory by now, of a quantum computing island etc
most of my thread was first based on the holographic principle, where everything in the universe breaks down to either a 1 or 0, and is capable of being described by numbers.
we are alll information.
anyway...
I was looking at more TOE sources and I found this..
sounds very dharma based...
Genetic algorithm
A genetic algorithm (or short GA) is a search (http://en.wikipedia.org/wiki/Search)technique (http://en.wikipedia.org/wiki/Technique) used in computing (http://en.wikipedia.org/wiki/Computing) to find true or approximate (http://en.wikipedia.org/wiki/Approximate) solutions to optimization (http://en.wikipedia.org/wiki/Optimization_%28mathematics%29) and search (http://en.wikipedia.org/wiki/Search)problems (http://en.wikipedia.org/wiki/Problem).
Genetic algorithms are categorized (http://en.wikipedia.org/wiki/Categorize) as global search heuristics (http://en.wikipedia.org/wiki/Global_optimization). Genetic algorithms are a particular class (http://en.wikipedia.org/wiki/Class) of evolutionary algorithms (http://en.wikipedia.org/wiki/Evolutionary_algorithm) that use techniques inspired by evolutionary biology (http://en.wikipedia.org/wiki/Evolutionary_biology) such as inheritance (http://en.wikipedia.org/wiki/Biological_inheritance), mutation (http://en.wikipedia.org/wiki/Mutation_%28genetic_algorithm%29), selection (http://en.wikipedia.org/wiki/Selection), and crossover (http://en.wikipedia.org/wiki/Crossover_%28genetic_algorithm%29) (also called recombination (http://en.wikipedia.org/wiki/Recombination)).
Genetic algorithms are implemented (http://en.wikipedia.org/wiki/Implementation) as a computer simulation (http://en.wikipedia.org/wiki/Computer_simulation) in which a population (http://en.wikipedia.org/wiki/Population) of abstract (http://en.wikipedia.org/wiki/Abstract) representations (called chromosomes (http://en.wikipedia.org/wiki/Chromosome_%28genetic_algorithm%29) or the genotype (http://en.wikipedia.org/wiki/Genotype) or the genome (http://en.wikipedia.org/wiki/Genome)) of candidate solutions (http://en.wikipedia.org/wiki/Candidate_solutions) (called individuals, creatures, or phenotypes (http://en.wikipedia.org/wiki/Phenotype)) to an optimization problem evolves toward better solutions (http://en.wikipedia.org/wiki/Solution_%28business%29).
Traditionally, solutions are represented in binary as strings of 0s and 1s, but other encodings are also possible.
The evolution usually starts from a population of randomly generated individuals and happens in generations.
In each generation, the fitness of every individual in the population is evaluated, multiple individuals are stochastically selected from the current population (based on their fitness), and modified (recombined and possibly mutated) to form a new population. The new population is then used in the next iteration of the algorithm (http://en.wikipedia.org/wiki/Algorithm).
Genetic algorithms find application (http://en.wikipedia.org/wiki/Genetic_algorithm#Applications) in computer science (http://en.wikipedia.org/wiki/Computer_science), engineering (http://en.wikipedia.org/wiki/Engineering), economics (http://en.wikipedia.org/wiki/Economics),chemistry (http://en.wikipedia.org/wiki/Chemistry), physics (http://en.wikipedia.org/wiki/Physics), mathematics (http://en.wikipedia.org/wiki/Mathematics) and other fields
so if these guys are in a quantum computing island/ simulated environment, being studied and healed and processed...
this sounds pretty plausible.
I put it in tle.. because I was origially going to connect it to mittleworks one true way statement..
ie :problem evolves toward better solutions (http://en.wikipedia.org/wiki/Solution_%28business%29).
most of my thread was first based on the holographic principle, where everything in the universe breaks down to either a 1 or 0, and is capable of being described by numbers.
we are alll information.
anyway...
I was looking at more TOE sources and I found this..
sounds very dharma based...
Genetic algorithm
A genetic algorithm (or short GA) is a search (http://en.wikipedia.org/wiki/Search)technique (http://en.wikipedia.org/wiki/Technique) used in computing (http://en.wikipedia.org/wiki/Computing) to find true or approximate (http://en.wikipedia.org/wiki/Approximate) solutions to optimization (http://en.wikipedia.org/wiki/Optimization_%28mathematics%29) and search (http://en.wikipedia.org/wiki/Search)problems (http://en.wikipedia.org/wiki/Problem).
Genetic algorithms are categorized (http://en.wikipedia.org/wiki/Categorize) as global search heuristics (http://en.wikipedia.org/wiki/Global_optimization). Genetic algorithms are a particular class (http://en.wikipedia.org/wiki/Class) of evolutionary algorithms (http://en.wikipedia.org/wiki/Evolutionary_algorithm) that use techniques inspired by evolutionary biology (http://en.wikipedia.org/wiki/Evolutionary_biology) such as inheritance (http://en.wikipedia.org/wiki/Biological_inheritance), mutation (http://en.wikipedia.org/wiki/Mutation_%28genetic_algorithm%29), selection (http://en.wikipedia.org/wiki/Selection), and crossover (http://en.wikipedia.org/wiki/Crossover_%28genetic_algorithm%29) (also called recombination (http://en.wikipedia.org/wiki/Recombination)).
Genetic algorithms are implemented (http://en.wikipedia.org/wiki/Implementation) as a computer simulation (http://en.wikipedia.org/wiki/Computer_simulation) in which a population (http://en.wikipedia.org/wiki/Population) of abstract (http://en.wikipedia.org/wiki/Abstract) representations (called chromosomes (http://en.wikipedia.org/wiki/Chromosome_%28genetic_algorithm%29) or the genotype (http://en.wikipedia.org/wiki/Genotype) or the genome (http://en.wikipedia.org/wiki/Genome)) of candidate solutions (http://en.wikipedia.org/wiki/Candidate_solutions) (called individuals, creatures, or phenotypes (http://en.wikipedia.org/wiki/Phenotype)) to an optimization problem evolves toward better solutions (http://en.wikipedia.org/wiki/Solution_%28business%29).
Traditionally, solutions are represented in binary as strings of 0s and 1s, but other encodings are also possible.
The evolution usually starts from a population of randomly generated individuals and happens in generations.
In each generation, the fitness of every individual in the population is evaluated, multiple individuals are stochastically selected from the current population (based on their fitness), and modified (recombined and possibly mutated) to form a new population. The new population is then used in the next iteration of the algorithm (http://en.wikipedia.org/wiki/Algorithm).
Genetic algorithms find application (http://en.wikipedia.org/wiki/Genetic_algorithm#Applications) in computer science (http://en.wikipedia.org/wiki/Computer_science), engineering (http://en.wikipedia.org/wiki/Engineering), economics (http://en.wikipedia.org/wiki/Economics),chemistry (http://en.wikipedia.org/wiki/Chemistry), physics (http://en.wikipedia.org/wiki/Physics), mathematics (http://en.wikipedia.org/wiki/Mathematics) and other fields
so if these guys are in a quantum computing island/ simulated environment, being studied and healed and processed...
this sounds pretty plausible.
I put it in tle.. because I was origially going to connect it to mittleworks one true way statement..
ie :problem evolves toward better solutions (http://en.wikipedia.org/wiki/Solution_%28business%29).