Ray Solomonoff

Vitanyi, P. "Obituary: Ray Solomonoff, Founding Father of Algorithmic Information Theory"Ray Solomonoff (Ụbọchị iri abụo na ise n'onwa Julaị n'afọ 1926 ruo ubochi asaa n'ọnwa Disemba n'afọ 2009)  bụ ónyé mepụtara ohere algorithmic, General Theory of Inductive Inference (nke a makwaara dị ka Universal Inductive inference),Samuel Rathmanner and Marcus Hutter. A philosophical treatise of universal induction. Entropy, 13(6):1076–1136, 2011. ọ bụkwa onye guzobere ozi algorithmic. Ọ bụ onye malitere ngalaba nke ọgụgụ isi aka dabere na mmụta igwe, amụma na ohere. "An Inductive Inference Machine", Dartmouth College, N.H., version of Aug. 14, 1956. (pdf scanned copy of the original) kesara akụkọ mbụ banyere mmụta igwe na-abụghị nke semantic na 1956. [1]

Solomonoff kọwara na mbụ ihe algorithmic nwèrè ike ime n'afọ 1960, na-ebipụta theorem nke malitere Kolmogorov mgbagwoju anya na algorithmic ozi theory. O bu ụzọ kọwaa nsonaazụ ndị a na nzukọ na Caltech n'afọ 1960, Paper from conference on "Cerebral Systems and Computers", California Institute of Technology, Feb 8–11, 1960, cited in "A Formal Theory of Inductive Inference, Part 1, 1964, p. 1. na akụkọ, Febụwarị 1960, "A Preliminary Report on a General Theory of Inductive Inference. " Solomonoff, R., "A Preliminary Report on a General Theory of Inductive Inference", Report V-131, Zator Co., Cambridge, Ma. Feb 4, 1960, revision, Nov., 1960. O mèrè ka echiche ndị a doo anya n'ụzọ zuru ezu na mbipụta ya nke afọ 1964, "A Formal Theory of Indictive Inferencia, "Part I Solomonoff, R., "A Formal Theory of Inductive Inference, Part I" Information and Control, Vol 7, No. 1 pp 1–22, March 1964. na Part II Solomonoff, R., "A Formal Theory of Inductive Inference, Part II" Information and Control, Vol 7, No. 2 pp 224–254, June 1964.

 Akụkọ ndụ site na 1964 
A mụrụ Ray Solomonoff n'ubochi iri abụo na ise n'onwa Julaị n'afọ 1926, na Cleveland, Ohio, nwa nke ndị Juu Russian kwagara Phillip Julius na Sarah Mashman Solomonoff. Ọ gara Glenville High School, gụsịrị akwụkwọ n'afọ 1944. N'afọ 1944, ọ sonyeere ndị agha mmiri United States dị ka onye nkuzi na Electronics. Site n'afo 1947 ruo afọ 1951 ọ gàrà Mahadum Chicago, na-amụ ihe n'okpuru ndị prọfesọ dịka Rudolf Carnap na Enrico Fermi, ma gụsịrị akwụkwọ na MS na Physics n'afọ 1951.

 Akụkọ ọrụ ruo 1964 
O dere akwụkwọ atọ, abụọ ya na Anatol Rapoport, n'afọ 1950 ruo afọ 1952, "An Exact Method for the Computation of the Connectivity of Random Nets", Bulletin of Mathematical Biophysics, Vol 14, p. 153, 1952. nke a na-ewere dị ka nyocha ọnụ ọgụgụ mbụ nke netwọk.

Ọ bụ otu n'ime ndị bịara iri n'afọ 1956 Dartmouth Summer Research Project on Artificial Intelligence.  O dere ma kesaa akụkọ n'etiti ndị bịara: "An Inductive Inference Machine". Ọ na-ele mmụta igwe anya dị ka ihe nwéré ike ime, na-ekwusi ike na mkpa usoro ọzụzụ dị, na iji akụkụ nke ngwọta gara aga màkà nsogbu na ịmepụta ngwọta nnwale màkà nsogbu ọhụrụ. An Inductive Inference Machine," IRE Convention Record, Section on Information Theory, Part 2, pp. 56–62.(pdf version) bipụtara otu ụdị nchọpụta ya na 1957. [1] Ndị a bụ akwụkwọ mbụ e dèrè na nkuzi igwe nwere ike.

Ọ gbasaa echiche ya, bipụta ọtụtụ akụkọ na-eduga na mbipụta n'afọ 1964. Akwụkwọ afọ 1964 na-enye nkọwa zuru ezu nke Algorithmic Probability, na Solomonoff Induction, na-egosi ụdị ise dị ichè ichè, gụnyere ụdị a na-akpọ Universal Distribution.

 Akụkọ ọrụ site na 1964 ruo 1984 
Ndị ọkà mmụta sayensị ndị ọzọ nọ n'afọ 1956 Dartmouth Summer Conference (dị ka Newell na Simon) na-emepe alaka nke Artificial Intelligence nke na-eji igwe na-achịkwa iwu if-then, dabere na eziokwu. Solomonoff na-emepe ngalaba nke Artificial Intelligence nke lekwasịrị anyá na ohere na amụma; echiche ya kpọmkwem banyéré AI kọwara igwe ndị na-achịkwa site na nkesa Algorithmic Probability. Ngwaọrụ ahụ na-emepụta echiche na ohere ha metụtara, iji dozie nsogbu, na ka nsogbu ọhụrụ na echiche na-etolite, na-emelite nkesa ohere na echiche ndị ahụ.

 Akụkọ ihe mere eme nke ọrụ - afọ ndị ikpeazụ 
N'akwụkwọ ndị ọzọ, ọ nyochara otu esi egbochi ógè achọrọ iji chọọ ngwọta, na-ede na ọchụchọ a kpaara ókè. Oghere ọchụchọ na-ejedebe site na ógè dịnụ ma ọ bụ ọnụahịa mgbakọ kama site na ibelata ohere ọchụnta ego dịka a na-eme na usoro amụma ndị ọzọ, dị ka Minimum Description Length.

N'otu édémédé e bipụtara n'afọ ọ nwụrụ, otu édémédé nke akwụkwọ akụkọ kwuru banyere Solomonoff, sị: "Ónyé ọkà mmụta sayensị na-aghọta sayensị ya site na iji otu 'paradigm dị ugbu a' - ụzọ nghọta nke kachasị ewu ewu n'oge a. Ónyé ọkà mmụta sayensi na-emepụta ihe na-aghọ sayensị ọ n'ọtụtụ ụzọ, ma nwee ike ịmepụta echiche ọhụrụ, ụzọ ọhụrụ nke nghọta, mgbè 'paradigma dị ugbu a" adabaghị na data dị ugbu a. " "Algorithmic Probability, Theory and Applications," In Information Theory and Statistical Learning, Eds Frank Emmert-Streib and Matthias Dehmer, Springer Science and Business Media, 2009, p. 11

 Hụkwa 

 Ming Li na Paul Vitanyi, Nkwupụta nke Kolmogorov Complexity na Mmetụta ya. Springer-Verlag, NY, 2008, gụnyere ihe ndekọ akụkọ ihe mere eme banyere Solomonoff yana nkọwa na nyocha nke ọrụ ya.
 Ihe omuma ihe omuma nke Marcus Hutter

 Edensibia