|
| |
| | Kolmogorov complexity - Wikipedia, the free encyclopedia |
 | | Algorithmic information theory is the area of computer science that studies Kolmogorov complexity and other complexity measures on strings (or other data structures). | | | In computer science, Kolmogorov complexity, (also known as descriptive complexity, Kolmogorov-Chaitin complexity, or algorithmic entropy) of an object such as a piece of text is a measure of how much information is needed to specify the object. | | | There are several variants of Kolmogorov complexity or algorithmic information. |
|
http://en.wikipedia.org/wiki/Algorithmic_information_theory
|
|
| |
| | Complexity & Information Theory |
| | The string's algorithmic information content, or aglorithmic complexity, is bounded from above by the length of the binary sequence specifying 'forty', together with the code which tells the computer to print a digit a certain number of times. | | | We define the algorithmic information content I(x) of an object (or bit string) x as the length of the shortest self delimiting program(s) for a Universal Turing Machine U which generates a description of that object for a given level of precision. | | | The central idea of algorithmic information theory is to quantify the information content of an object or bit string in terms of its shortest description. |
|
http://www.mulhauser.net/research/tutorials/complexity/complexity.html
|
|
| |
| | Theory - Wikipedia, the free encyclopedia |
| | Theories are formulated, developed and evaluated according to the scientific method. | | | This is true of such established theories as special and general relativity, quantum mechanics (with minimal interpretation), plate tectonics, evolution, etc. | | | This knowledge consists of axioms, definitions, theorems and computational techniques, all related in some way by tradition or practice. |
|
http://www.bexley.us/project/wikipedia/index.php/Theory
|
|
| |
| | Quantum algorithmic information theory |
| | The agenda of quantum algorithmic information theory, ordered `top-down,' is the quantum halting amplitude, followed by the quantum algorithmic information content, which in turn requires the theory of quantum computation. | | | The fundamental atoms processed by quantum computation are the quantum bits which are dealt with in quantum information theory. | | | The theory of quantum computation will be based upon a model of universal quantum computer whose elementary unit is a two-port interferometer capable of arbitrary U(2) transformations. |
|
http://tph.tuwien.ac.at/~svozil/publ/qait.htm
|
|
| |
| | A New Version of Algorithmic Information Theory |
| | The main application of algorithmic information theory is its information-theoretic incompleteness theorems. | | | In algorithmic information theory, given a self-delimiting universal Turing machine, one defines a program-size complexity measure from it. | | | This theory is concerned with the size of programs, but up to now these have never been programs that one could actually program out and run on interesting examples. |
|
http://www.umcs.maine.edu/~chaitin/nv.html
|
|
| |
| | Algorithmic Information Theory - Chaitin (ResearchIndex) |
| | 45 the Symmetry of Algorithmic Information (context) - Gac - 1974 | | | Abstract: This paper reviews algorithmic information theory, which is an attempt to apply information-theoretic and probabilistic ideas to recursive function theory. | | | Typical concerns in this approach are, for example, the number of bits of information required to specify an algorithm, or the probability that a program whose bits are chosen by coin flipping produces a given output. |
|
http://citeseer.ist.psu.edu/chaitin77algorithmic.html
|
|
| |
| | Goedel's Theorem and Information |
| | The fundamental concepts of this new information theory are: algorithmic information content, joint information, relative information, mutual information, algorithmic randomness, and algorithmic independence. | | | The algorithmic information content H(X) of an individual object X is defined to be the size of the smallest program to calculate X. | | | Chaitin, G. Algorithmic information theory, IBM Journal of Research and Development, 21, 350-359, 496. |
|
http://www.cs.umaine.edu/~chaitin/georgia.html
|
|
| |
| | Algorithmic information theory (from information theory) -- Encyclopædia Britannica |
| | class of quantum field theory used to describe subatomic particles and their associated relativistic quantum fields; all measurable physical properties remain unchanged when certain mathematical symmetry operations are performed on the quantum fields; believed that the final unification of the four fundamental interactions—gravitational, electromagnetic, strong, and... | | | More results on "Algorithmic information theory (from information theory)" when you join. | | | It attempts to bring together concepts and methods from various disciplines such as library science, computer science and engineering, linguistics, psychology, and other technologies in order to develop techniques and devices to aid in the handling—that is, in the collection, organization,... |
|
http://www.britannica.com/eb/article-214957?tocId=214957
|
|
| |
| | Omniseek: /Computing /Artificial Life /Science: Math: Information Theory / |
| | An agenda of quantum algorithmic information theory, ordered `top-down' by Karl Svozil : the quantum halting amplitude, followed by the quantum algorithmic information content, which in turn requires the theory of quantum computation. | | | A controversial paper by Max Tegmark suggesting that the algorithmic information content of the universe as a whole is close to zero. | | | Interesting papers on evolutionary computation and on computation in artificially evolved, non-uniform cellular automata. |
|
http://www.omniseek.com/srch/{2307}
|
|
| |
| | Open Directory - Science: Math: Applications: Information Theory |
| | Introduction To Algorithmic Information Theory - An introduction to the synthesis of computation and information theory by Nick Szabo. | | | Algorithmic Information Theory - Open problems and links to software. | | | Quantum Information Theory - A presentation at the undergraduate level by Michael Gibbs. |
|
http://dmoz.org/Science/Math/Applications/Information_Theory
|
|
| |
| | Algorithmic Information Theory |
| | The basic idea is to measure the complexity of an object by the size in bits of the smallest program for computing it. | | | ) is the result of putting Shannon's information theory and Turing's computability theory into a cocktail shaker and shaking vigorously. |
|
http://www.cs.auckland.ac.nz/CDMTCS/docs/ait.html
|
|
| |
| | INFORMATION, RANDOMNESS AND INCOMPLETENESS |
| | Chaitin's ideas are a fundamental extension of those of Gödel and Turning and have exploded some basic assumptions of mathematics and thrown new light on the scientific method, epistemology, probability theory, and of course computer science and information theory. | | | This book contains in easily accessible form all the main ideas of the creator and principal architect of algorithmic information theory. | | | Very complete, it is recommended to anyone who is interested in algorithmic information theory." (translated) |
|
http://www.worldscibooks.com/compsci/1048.htm
|
|
| |
| | AIT05 mainpage |
| | Algorithmic Information Theory is an international meeting bringing together mathematicians, computer theorists, logicians, mathematical physicists and scientists in related fields to assess the impact of recent development in the foundations of mathematics, computability, computation and computer- | | | Welcome to the Algorithmic Information Theory Conference in Vaasa 16th-18th May 2005 | | | supported mathematical theory exploration, and to stimulate further research in these and related fields. |
|
http://www.uwasa.fi/ait05
|
|
| |
| | CFP: Special SCI Session on Complexity and Algorithmic Information Theory with Application to Systems, Networks, and ... |
| | The goal of this session is to compare traditional state-of-the-art methods with new advances incorporating Complexity-based or Algorithmic Information methods and discuss their applications to the health, management, and security of information systems. | | | This session seeks to consolidate research in the areas of modeling, management, and security in systems and networks with the large and growing body of work in Complexity and Algorithmic Information Theory. | | | CFP: Special SCI Session on Complexity and Algorithmic Information Theory with Application to Systems, Networks, and Information Assurance |
|
http://www.cs.utah.edu/flux/cipher/cfps/cfp-SCI2002.html
|
|
| |
| | References of Cliff Joslyn, Letter: C |
| | Collier, John: (1990) "Intrinsic Information", in: Information, Language and Cognition, ed. | | | Cerro, LF del and Herzig, Andreas: (1991) "Modal Analysis of Possibility Theory", in: Symbolic and Quantitative Approaches to Uncertainty, ed. | | | Chaitin, Gregory J: (1977) "Algorithmic Information Theory", IBM J. Research Development, v. |
|
http://www.c3.lanl.gov/~joslyn/refs/refs_c.html
|
|
| |
| | G J Chaitin Home Page |
| | Its members believe that the world is built out of digital information, out of 0 and 1 bits, and they view the universe as a giant information-processing machine, a giant digital computer. | | | From Philosophy to Program Size, Tallinn Institute of Cybernetics, 2003. | | | Gregory Chaitin has devoted his life to the attempt to understand what mathematics can and cannot achieve, and is a member of the digital philosophy/digital physics movement. |
|
http://www.cs.auckland.ac.nz/CDMTCS/chaitin
|
|
| |
| | The Limits of Mathematics -- from Mathematica Information Center |
| | This book is the final version of a course on algorithmic information theory and the epistemology of mathematics and physics. | | | The Limits of Mathematics -- from Mathematica Information Center | | | It discusses Einstein and Godel's views on the nature of mathematics in the light of information theory, and sustains the thesis that mathematics is quasi-empirical. |
|
http://library.wolfram.com/infocenter/MathSource/729
|
|
| |
| | Information: Chaitin, Randmoness, and Algorithmic Information Theory |
| | H(X) = "algorithmic information content" or "program-size complexity" of X | | | H(X) = size in bits of the most concise program capable of calculating X | | | only way to get this information out of a FAS is to put it in as axioms |
|
http://serendip.brynmawr.edu/local/scisoc/information/marshall1july04.html
|
|
| |
| | ScienceDaily All Products : Bestsellers |
| | Principal investigator Dr. Daniel Bowers, assistant professor of pediatrics, and other UT Southwestern researchers identified the link using patient information from a national database of long-term childhood cancer survivors. | | | The purpose of the survey was to determine how the drug was dispensed in women who subsequently became pregnant and to identify possible reasons for failure in preventing conception. | | | A study published in Birth Defects Research (Part A): Clinical and Molecular Teratology surveyed pregnant women who contacted a birth defect information service seeking information on the effects of isotretinoin. |
|
http://sciencedaily.com/cgi-bin/apf4/amazon_products_feed.cgi?...
|
|
|
