%0 Journal Article %1 Friedberg:1958:LMI %A Friedberg, R. M. %D 1958 %J IBM Journal of Research and Development %K Learning, Machine intron, schema %N 1 %P 2--13 %T A learning machine: I %U http://www.research.ibm.com/journal/rd/021/ibmrd0201B.pdf %V 2 %X Machines would be more useful if they could learn to perform tasks for which they were not given precise methods. Difficulties that attend giving a machine this ability are discussed. It is proposed that the program of a stored-program computer be gradually improved by a learning procedure which tries many programs and chooses, from the intructions that may occupy a given location, the one most often associated with a successful result. An experimental test of this principle is described in detail.

@article{Friedberg:1958:LMI, abstract = {Machines would be more useful if they could learn to perform tasks for which they were not given precise methods. Difficulties that attend giving a machine this ability are discussed. It is proposed that the program of a stored-program computer be gradually improved by a learning procedure which tries many programs and chooses, from the intructions that may occupy a given location, the one most often associated with a successful result. An experimental test of this principle is described in detail.}, acknowledgement = {Nelson H. F. Beebe, University of Utah, Department of Mathematics, 110 LCB, 155 S 1400 E RM 233, Salt Lake City, UT 84112-0090, USA, Tel: +1 801 581 5254, FAX: +1 801 581 4148, e-mail: \path|beebe@math.utah.edu|, \path|beebe@acm.org|, \path|beebe@computer.org| (Internet), URL: \path|http://www.math.utah.edu/~beebe/|}, added-at = {2008-06-19T17:35:00.000+0200}, author = {Friedberg, R. M.}, bibdate = {Mon Feb 12 08:25:35 2001}, biburl = {https://www.bibsonomy.org/bibtex/25c803374f8d593b600ac2e3badf3e90d/brazovayeye}, coden = {IBMJAE}, interhash = {b69389cd1e4861d528b8132303ebdb39}, intrahash = {5c803374f8d593b600ac2e3badf3e90d}, issn = {0018-8646}, journal = {IBM Journal of Research and Development}, keywords = {Learning, Machine intron, schema}, month = {January}, mrclass = {68.0X}, mrnumber = {19,1085c}, mrnumber-url = {http://www.ams.org/mathscinet-getitem?mr=19%2c1085c}, notes = {Not a GP, for example there is no population and no genetic operations, nonetheless included for general GP interest. Includes discussion of introns and schema (but not under those names). IBM 704. 64 bits of memory. 64 (fixed) instructions. Conditional branch (ie IF), AND, MOVE and NOT. Loops halted after 64 time steps and given zero fitness. Hitch hikers. Herman and Sherman shows importance of details of representation (not fully understood). Cultural evolution, cf \cite{spector:1996:ctiGP}. One bit identity (move a bit). Two bit sum (failed), high bit of sum, low bit of sum. One bit complement (not).}, number = 1, pages = {2--13}, reviewer = {M. L. Minsky}, size = {12 pages}, timestamp = {2008-06-19T17:39:51.000+0200}, title = {A learning machine: {I}}, url = {http://www.research.ibm.com/journal/rd/021/ibmrd0201B.pdf}, volume = 2, year = 1958 }