A learning machine: part II

Authors:
R. M. Friedberg;B. Dunham;J. H. North
Affiliations:
-;-;-
Venue:
IBM Journal of Research and Development
Year:
1959

Citing 0
Cited 10

Automatic Recurrent and Feed-Forward ANN Rule and Expression Extraction with Genetic Programming

PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Computational Intelligence: Concepts to Implementations

Computational Intelligence: Concepts to Implementations
Introduction to the special issue: Trends in evolutionary methods for program induction

Evolutionary Computation
Open issues in genetic programming

Genetic Programming and Evolvable Machines
Generation and simplification of Artificial Neural Networks by means of Genetic Programming

Neurocomputing
Quantum-inspired evolutionary algorithms: a survey and empirical study

Journal of Heuristics
Modeling and designing of machine learning procedures as applied to game playing using artificial intelligence

ACAI '11 Proceedings of the International Conference on Advances in Computing and Artificial Intelligence
On the origin of the evolutionary computation species influences of Darwin's theories on computer science

Artificial Intelligence Review
Ubiquity symposium: Evolutionary computation and the processes of life: opening statement

Ubiquity
A Historical Perspective on the Evolution of Executable Structures

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

An effort is made to improve the performance of the learning machine described in Part I, and the over-all effect of various changes is considered. Comparative runs by machines without the scoring mechanism indicate that the grading of individual instructions can aid in the learning process. A related study is made in which automatic debugging of programs is taken as a special case of machine search. The ability to partition problems and to deal with parts in order of difficulty proves helpful.