Too busy to learn [individual learning interaction with evolutionary algorithm in Busy Beaver problem]

Proceedings of the 2000 Congress on Evolutionary Computation, CEC 2000

Volumn 1, Issue , 2000, Pages 720-727

  Pereira, Francisco B ^a,b   Machado, Penousal ^a,b   Costa, Ernesto ^b   Cardoso, Amilcar ^b   Ochoa Rodriguez, Alberto ^c   Santana, Roberto ^c   Soto, Marta ^c  

^a POLYTECHNIC INSTITUTE OF COIMBRA   (Portugal)

^b UNIVERSITY OF COIMBRA   (Portugal)

^c INSTITUTO DE CIBERNÉTICA   (Cuba)

Author keywords

[No Author keywords available]

Indexed keywords

REPAIR; DATA STRUCTURES; LEARNING SYSTEMS; MATHEMATICAL MODELS;

BUSY BEAVER PROBLEMS; INDIVIDUAL LEARNING; LEARNING MODELS; LOCAL SEARCH; LOCAL SEARCH METHOD; MUTATION RATES; PRE-MATURE CONVERGENCES; SEARCH SPACES;

EVOLUTIONARY ALGORITHMS; LEARNING ALGORITHMS;

EVOLUTIONARY ALGORITHMS;

EID: 0033676677     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2000.870369     Document Type: Conference Paper

References (20)

1. Belew, R. and Mitchell, M. (1996). Adaptive Individuals in Evolving Populations: Models and Algorithms, Santa Fe Institute in the Sciences of Complexity, Vol. XXVI, Reading, MA: Addison-Wesley.
2. Boolos, G., and Jeffrey, R. (1995). Computability and Logic, Cambridge University Press.
3. Goodman, E. (1996). GALOPPS, The Genetic Algorithm Optimized for Portability and Parallelism System, Technical Report #96-07-01, Michigan State University.
4. Hart, W. E., Kammeyer, T. E. and Belew, R. K. (1995). The Role of Development in Genetic Algorithms. In Whitley, D. and Vose, M. D. (Eds.), Foundations of Genetic Algorithms 3, California: Morgan Kaufmann.
5. Harvey, I., Stone, J. (1995). Unicycling Helps your French: Spontaneous Recovery of Association by Learning Unrelated Tasks. Cognitive Science Research Paper CSRP 379, School of Cognitive and Computing Sciences, University of Sussex, England, UK.
6. Harvey, I. (1997). Is There Another New Factor in Evolution?, Evolutionary Computation, Vol. 4(3), pp. 313-329.
7. Jones, T. and Rawlins, G. (1993). Reverse Hillclimbing, Genetic Algorithms, and the Busy Beaver Problem. In Forrest, S. (Ed.). Proceedings of the 5lh International Conference on Genetic Algorithms (ICGA-93), pp.70-75, San Mateo, CA, Morgan Kaufmann.
8. Machado, P., Pereira, F. B, Cardoso, A., Costa, E. (1999). Busy Beaver-The Influence of Representation, Proceedings of the Second European Workshop in Genetic Programming, Goteborg, Sweden.
9. Muhlenbein, H. and Paass, G. (1996). From Recombination of Genes to the Estimation of Distributions I. Binary Parameters. In Voigt, H-M, Ebeling, W., Rechenberg, I. and Schwefel, H.-P. (Eds.), Parallel Problem Solving from Nature, pp. 178-187, SpringerrBerlin.
10. Nolfi, S. Elman, J, and Parisi, D. (1994). Learning and Evolution in Neural Networks. Adaptive Behavior, Vol. 3(1), p. 5-28.
11. Pelikan, M., Goldberg, D., and Lobo, F. (1999). A Survey of Optimization by Building and Using Probabilistic Models. IlliGAL Report No. 99018, University of Illinois.
12. Pereira, F. B., Machado, P., Costa, E. and Cardoso, A. (1999). Busy Beaver: An Evolutionary Approach. Proceedings of the 2nd Symposium on Artificial Intelligence, pp.212.216. Havana, Cuba.
13. Pereira, F.B., Machado, P., Costa, E. and Cardoso A. (1999). Graph Based Crossover-A Case Study with the Busy Beaver Problem. In Banzhaf, W., Daida, J., Eiben, A. E., Garzon, M. H., Honavar, V., Jakiela, M., & Smith, R. E. (Eds.). GECCO-99: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1149-1155, Orlando, Florida, USA. Morgan Kaufmann.
14. Rado, T. (1962) On non-computable functions, The Bell System Technical journal, vol. 41, no. 3, pp.877-884.
15. Santana, R., Rodriguez, A. O., Soto, M., Pereira, F. B., Machado, P., Costa, E. and Cardoso, A. (2000). Probabilistic Evolution and the Busy Beaver Problem. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000), (to appear).
16. Sasaki, T. and Tokoro, M. (1999). Adaptation under Changing Environments with Various Rates of Inheritance of Acquired Characters: Comparison Between Darwinian and Lamarckian Evolution. In McKay, B., Yao, X., Newton, C. S., Kim, J. H. and Furuhashi, T. (Eds.), Proceedings of 2nd Asia-Pacific Conference on Simulated Evolution and Learning (SEAL-98), Canberra, Australia.
17. Turney, P., Whitley, D., and Anderson, R. (1997). Evolution, Learning and Instinct: 100 Years of the Baldwin Effect, Evolutionary Computation, Vol. 4(3), iv-viii.
18. Watson, R., and Pollack, J. (1999). How Symbiosis Can Guide Evolution. In Nicoud, J.-D. and Mondada, F. (Eds.) Proceedings of the 5,h European Conference on Artificial Life, Springer-Verlag.
19. Whitley, D., Gordon, S. and Mathias, K.(1994). Lamarckian Evolution, the Baldwin Effect and Function Optimization. In Davidor, Y., Schwefel, H. P. and Manner, R. (Eds.), Parallel Problem Solving from Nature-PPSN III, 6-15. Berlin: Springer-Verlag.
20. Wood, D. (1987). Theory of Computation, Harper & Row, Publishers.