Genetic algorithms in Forth

07/17/2018
by   S. I. Khashin, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/05/2010

Results of Evolution Supervised by Genetic Algorithms

A series of results of evolution supervised by genetic algorithms with i...
research
08/02/2018

Systematic Testing of Genetic Algorithms: A Metamorphic Testing based Approach

Genetic Algorithms are a popular set of optimization algorithms often us...
research
10/25/2019

A Curious Link Between Prime Numbers, the Maundy Cake Problem and Parallel Sorting

We present new theoretical algorithms that sums the n-ary comparators ou...
research
01/17/2019

Genetic Algorithms and the Traveling Salesman Problem a historical Review

In this paper a highly abstracted view on the historical development of ...
research
07/23/2019

Searching the Landscape of Flux Vacua with Genetic Algorithms

In this paper, we employ genetic algorithms to explore the landscape of ...
research
02/13/2023

Computing the congruences of a finite semigroup or monoid

In this paper we describe two different algorithms for computing the con...
research
07/12/2016

Generating Cycloidal Gears for 3D Printing

(Shortened version of abstract in article itself) This article describ...

Please sign up or login with your details

Forgot password? Click here to reset