
	Where results make sense

Topic: Ray Solomonoff

Related Topics

Minimum message length

Kolmogorov complexity

Gregory Chaitin

Andrey Kolmogorov

Turing machine

	Information Theory and Creationism: Algorithmic Information Theory (Chaitin, Solomonoff & Kolmogorov)
		Information Theory and Creationism: Algorithmic Information Theory (Chaitin, Solomonoff and Kolmogorov)
		A web site with numerous references and links (some expired) on the ideas of Kolmogorov and Solomonoff.
		, Ray Solomonoff, and Andrei Kolmogorov developed a different view of information from that of Shannon.
	home.mira.net /~reynella/debate/algorith.htm (1194 words)

	Information Theory and Creationism: Algorithmic Information Theory (Chaitin, Solomonoff & Kolmogorov)
		Our apologies, but you must have JavaScript enabled to view author contact information.
		Kolmogorov, Chaitin, and Solomonoff independently came up with the idea of representing the complexity of a string based on its compressibility by representing it as a program.
		Given a Universal Turing Machine U, the algorithmic information content, also called algorithmic complexity or Kolmogorov Complexity (KC) H(X) of string X is defined as the length of the shortest program p on U producing string X.
	www.talkorigins.org /faqs/information/algorithmic.html (3567 words)

Try your search on: Qwika (all wikis)