Theoremadvanced
Schema theorem
Also called fundamental theorem of genetic algorithms.
Short, fit, low-order schemata grow exponentially in the population over generations.
Short, fit, low-order schemata grow exponentially in the population over generations.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag MGN8A0 Edit this page History Report an error