Turing complete computer implemented machine learning method and

Details Turing complete computer implemented machine learning method and Turing complete computer implemented machine learning method and

1998-06-29

1999-08-31

Downs, Robert W.

Data processing: artificial intelligence

Machine learning

Genetic algorithm and genetic programming system

G06F 1518

Patent

active

059466740

ABSTRACT:
One or more machine code entities such as functions are created which represent solutions to a problem and are directly executable by a computer. The programs are created and altered by a program in a higher level language such as "C" which is not directly executable, but requires translation into executable machine code through compilation, interpretation, translation, etc. The entities are initially created as an integer array that can be altered by the program as data, and are executed by the program by recasting a pointer to the array as a function type. The entities are evaluated by executing them with training data as inputs, and calculating fitnesses based on a predetermined criterion. The entities are then altered based on their fitnesses using a machine learning algorithm by recasting the pointer to the array as a data (e.g. integer) type. This process is iteratively repeated until an end criterion is reached. The entities evolve in such a manner as to improve their fitness, and one entity is ultimately produced which represents an optimal solution to the problem. Each entity includes a plurality of directly executable machine code instructions, a header, a footer, and a return instruction. The instructions include branch instructions which enable subroutines, leaf functions, external function calls, recursion, and loops. The system can be implemented on an integrated circuit chip, with the entities stored in high speed memory in a central processing unit.

REFERENCES:
patent: 5390282 (1995-02-01), Koza et al.
patent: 5742738 (1998-04-01), Koza et al.
Ray, T.S., "Is It Alive or Is It GA?", School of Life & Health Sciences, University of Deleware, XP 002047764, pp. 527-534, Jul. 1991.
Nordin, P., "A Compiling Genetic Programming System that Directly Manipulates the Machine Code," in Advances in Genetic Programming, K.E. Kinnear, Jr., ed., MIT Press, Chapt. 14, pp. 311-331, Dec. 1994.
Nordin, P., et al., "Explicitly Defined Introns and Destructive Crossover in Genetic Programming," Advances in Genetic Programming II, Jul. 1995.
Nordin, P. and Banzhaf, W., "Real Time Evolution of Behavior and a World Model for a Miniature Robot using Genetic Programming," Dept. of Computer Science, University of Dortmund, Germany, pp. 1-32, Nov. 1995.
Nordin, P. and Banzhaf, W., "Evolving Turing-Complete Programs for a Register Machine with Self-modifying Code," Proc. Int'l. Conf. on Genetic Algorithms, Dec. 1995.

Affiliated with

Also associated with

Rating

Turing complete computer implemented machine learning method and does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Turing complete computer implemented machine learning method and, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Turing complete computer implemented machine learning method and will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2428850