General (Behavior Based) Computational Learning Theory (
)
G.Doeben-Henisch
University of Applied Sciences Frankfurt am Main (Germany)
Faculty of Computer Science and Engineering
- Contents
- Preface
- Philosophy of Engineered Intelligent Systems
- Genetic Algorithms (GAs)
- Biological Dimension of GAs
- GA as Model of Genetic Inheritance
- GA Example
- GA Structure
- GAS Example: Numbers and Function
- Theoretical Limits and Benchmarks
- Pure Chance Genetics
- Empirical Results
- GA against Pure Chance
- GA only crossover 1-3
- GA crossover + mutation 1-3
- Pure Chance 1-3
- Result of Comparison GA vs. Pure Chance
- Different Patterns
- Theoretical Convergence
- Experiments with the fitnes ratio
- Summary
- l=3,n=8, exp.1
- l=3,n=8, exp.2
- l=3,n=8, exp.3
- l=5, n=8,exp.1
- l=5, n=8, exp.2
- l=5, n=8, exp.3
- l=5,n=32, exp.1
- l=5,n=32, exp.2
- l=5,n=32, exp.3
- l=5,n=32, -mut, exp.1
- l=5,n=32, -mut, exp.2
- l=5,n=32, -mut, exp.3
- l=5, n=128, exp.1
- l=5, n=128, exp.2
- l=5, n=128, exp.3
- l=5, n=128, -mut, exp.1
- l=5, n=128, -mut, exp.2
- l=5, n=128, -mut, exp.2
- l=5, n=128, -mut, exp.3
- GA with Multicompartment Genomes
- From Multicompartment Genomes to Classifiers
- Example with Tic Tac Toe Game
- (Emotional) Learning Classifier Systems ((E)LCS)
- Sign Concept
- Consciousness
- Semiotic Agents as Memetic Systems
- Case Studies
- Learner With Body and Self
- Technical Appendix: GA
- Tech.Appendix: LCS for Tic-Tac-Toe
- Technical Appendix: ECM Implementation
- Technical Appendix: A SECoS-Implementation
- Tech.Appendix: LCS as ZCS0
- Testrun Regulär D=1, 1 Food
- Testrun Regulär D=2, 1 Food
- Testrun Regulär D=3, 1 Food
- Testrun 2 Objects 1 Food, D=3
- Testrun 2 Objects, 1 Food, D=3
- Testrun 2 Objects, 1 Food, D=3
- Testrun ANIMAT
, D=1, O=0
- Tech.Appendix: LCS as ZCS1
- Tech.Appendix: LCS as EZCS2
- Testfragen
- Bibliography
- About this document ...
Gerd Doeben-Henisch
2012-03-31
