Genetic algorithms in Forth
Neural and Evolutionary Computing
2018-07-18 v1 Programming Languages
Abstract
A method for automatically finding a program (bytecode) realizing the given algorithm is developed. The algorithm is specified as a set of tests (input\_data) (output\_data). Genetic methods made it possible to find the implementation of relatively complex algorithms: sorting, decimal digits, GCD, LCM, factorial, prime divisors, binomial coefficients, and others. The algorithms are implemented on a highly simplified version of Forth language.
Keywords
Cite
@article{arxiv.1807.06230,
title = {Genetic algorithms in Forth},
author = {S. I. Khashin and S. E. Vaganov},
journal= {arXiv preprint arXiv:1807.06230},
year = {2018}
}
Comments
17 pages