Thu, 21 Aug 2008 15:51:07 BST CiteULike: Tag aixi http://www.citeulike.org/tag/aixi CiteULike.org en-gb Copyright © 2004-2008 citeulike.org http://www.citeulike.org/user/Scis0000002/article/1427499 <i>(2000)</i><br /><br />The HR program, Colton et al. (1999), performs theory formation in domains of pure mathematics. Given only minimal information about a domain, it invents concepts, make conjectures, proves theorems and finds counterexamples to false conjectures. We present here a multi-agent version of HR which may provide a model for how individual mathematicians perform separate investigations but communicate their results to the mathematical community, learning from others as they do. We detail the... Agent based cooperative theory formation in pure mathematics S Colton A Bundy T Walsh (2000) 2007-07-01T15:37:07-00:00 2000 agent-theory aixi argumentation argumentation-games argumentation-theory category-of-theories collaboration computability-logic computational-science dialogical-logic distributed distributed-operating-system experts extendability formal-digital-library formal-interoparability formal-problem-solving formal-science formation game-theory goedel-machine heterogeneous hyperefficiency hypernetworks iff interoperability logical-theories markets mathematics mechanized-mathematics metascience mkm oops optimality philosophy-of-science problem-solving proof-search resource-allocation scientific-community semweb socio-economic-systems theory-development unified-concept-theory http://www.citeulike.org/user/Scis0000002/article/1205241 <i>ArXiv Computer Science e-prints (April 2000)</i><br /><br />Decision theory formally solves the problem of rational agents in uncertain worlds if the true environmental prior probability distribution is known. Solomonoff's theory of universal induction formally solves the problem of sequence prediction for unknown prior distribution. We combine both ideas and get a parameterless theory of universal Artificial Intelligence. We give strong arguments that the resulting AIXI model is the most intelligent unbiased agent possible. We outline for a number of problem classes, including sequence prediction, strategic games, function minimization, reinforcement and supervised learning, how the AIXI model can formally solve them. The major drawback of the AIXI model is that it is uncomputable. To overcome this problem, we construct a modified algorithm AIXI-tl, which is still effectively more intelligent than any other time t and space l bounded agent. The computation time of AIXI-tl is of the order tx2^l. Other discussed topics are formal definitions of intelligence order relations, the horizon problem and relations of the AIXI theory to other AI approaches. A Theory of Universal Artificial Intelligence based on Algorithmic Complexity M Hutter ArXiv Computer Science e-prints (April 2000) 2007-04-03T23:13:43-00:00 2000 ArXiv Computer Science e-prints aixi computability-logic computational-games computational-intelligence gtm hypercomputability intelligence-order-relations power power-order-relations utm http://www.citeulike.org/user/scis0000001/article/845318 <i>(27 Dec 2004)</i><br /><br />A Goedel Machine is designed to solve arbitrary computational problems, such as maximizing the expected future reward of a robot in a possibly stochastic and reactive environment. Its initial software includes an axiomatic description of (1) the Goedel machine's hardware, (2) known aspects of the environment, (3) goals and rewards to be achieved, (4) costs of actions and computations, (5) the initial software itself (no circularity involved here). It also includes a possibly sub-optimal initial problem-solving policy and a proof searcher searching the space of computable proof techniques - that is, programs whose outputs are proofs. Unlike previous approaches, the self-referential Goedel machine will rewrite any part of its software (including axioms and proof searcher) as soon as it has found a proof that this will improve its future performance, given typically limited computational resources (its optimality notion is not restricted to the concept of asymptotic optimality). Self-rewrites represent globally optimal self-improvements (no local minima!), since provably none of all the alternative rewrites and proofs (that could be found in the future by continuing the proof search) is worth waiting for. To initialize the proof searcher we may use the recent Optimal Ordered Problem Solver. Goedel Machines: Self-Referential Universal Problem Solvers Making Provably Optimal Self-Improvements Juergen Schmidhuber (27 Dec 2004) 2006-09-15T13:12:04-00:00 2004 adaptability aixi all-logical-theories atp autonomic-computing bias biops chu-space computability-logic computational-epistemology computational-learning computational-mathematics computational-science domain-theory dynamics efficiency formal-development formal-system generalized-kolmogorov-complexity goedel-machine gtm iff inference inference-dynamics interactivity lattice-of-theories least-time machine-learning metaevolution metalogic-programming metalogics metascience model-selection oops optimality paraconsistency problem-solving proof-search reinforcement-learning resource-allocation robotics searching self-adaptation self-managing self-reference semweb speed-prior survivability temporal-logic universality universal-search utility http://www.citeulike.org/user/scis0000001/article/849822 <i>(10 Dec 2004)</i><br /><br />Computability logic is a formal theory of (interactive) computability in the same sense as classical logic is a formal theory of truth. This approach was initiated very recently in "Introduction to computability logic" (Annals of Pure and Applied Logic 123 (2003), pp.1-99). The present paper reintroduces computability logic in a more compact and less technical way. It is written in a semitutorial style with a general computer science, logic or mathematics audience in mind. An Internet source on the subject is available at <a href="http://www.cis.upenn.edu/~giorgi/cl.html">this http URL</a>, and additional material at <a href="http://www.csc.villanova.edu/~japaridz/CL/gsoll.html">this http URL</a> . Computability Logic: a formal theory of interaction Giorgi Japaridze (10 Dec 2004) 2006-09-19T15:36:25-00:00 2004 abstract-state-machines adaptability aixi all-logical-theories behavior chu-space classical-logic computability computability-logic computational-epistemology dynamics formal-theory iff interaction interactivity interference intuitionistic-logic linear-logic logic relativity http://www.citeulike.org/user/scis0000001/article/769988 <i></i><br /><br />The interaction paradigm provides a new conceptualization of computational phenomena that emphasizes interaction rather than algorithms, thus reflecting the shift in technology from number-crunching on mainframes to distributed intelligent networks with graphical user interfaces. Goldin, Smolka, and Wegner have structured the 18 contributions from distinguished researchers into four sections: "Introduction", consisting of three chapters that explore and summarize the fundamentals of interactive computation; "Theory" with six chapters, each discussing a specific aspect of interaction; "Applications" showing in five chapters how this principle is applied in various subdisciplines of computer science; and "New Directions" presenting four multidisciplinary applications beyond computer science. The book challenges traditional Turing machine-based answers to fundamental questions relating to problem solving and the scope of computation. Assuming the reader has only an undergraduate-level background in computer science, it serves as an introduction to this increasingly important discipline. Interactive Computation: The New Paradigm Dina Goldin Scott Smolka Peter Wegner 2006-07-23T06:09:01-00:00 Springer adaptability aixi behavior chu-space computability computability-logic computational-epistemology dynamics iff interactivity interference paraconsistency relativity http://www.citeulike.org/user/scis0000001/article/821144 <i>(2000)</i><br /><br />The paper sketches the place of dynamic semantics within a broader picture of developments in philosophical and linguistic theories of meaning. Some basic concepts of dynamic semantics are illustrated by means of a detailed analysis of anaphoric definite and indefinite descriptions, which are treated as contextually dependent quantificational expressions. It is shown how a dynamic view sheds new light on the contextual nature of interpretation, on the di#erence between monologue and... Meaning in Motion Jeroen Groenendijk Martin Stokhof (2000) 2006-08-29T13:37:39-00:00 2000 aixi chu-space computability-logic context-relativity dynamics interactivity interference meaning relativity semantics http://www.citeulike.org/user/scis0000001/article/786765 <i>No. IDSIA-01-03. (2003)</i><br /><br />Decision theory formally solves the problem of rational agents in uncertain worlds if the true environmental prior probability distribution is known. Solomonoff's theory of universal induction formally solves the problem of sequence prediction for unknown prior distribution. We combine both ideas and get a parameterless theory of universal Artificial Intelligence. We give strong arguments that the resulting AIXI model is the most intelligent unbiased agent possible. We outline for a number of... A Gentle Introduction to The Universal Algorithmic Agent AIXI Marcus Hutter No. IDSIA-01-03. (2003) 2006-08-05T09:05:30-00:00 2003 IDSIA-01-03 adaptability aixi al artificial-physics complexity computability-logic computational-epistemology emergence formation iff inductive-inference intelligence-order-relations interactivity machine-learning model model-selection order ordering paraconsistency prequential taxanomy uai universality http://www.citeulike.org/user/scis0000001/article/997769 <i></i><br /><br />Prequential Analysis is an approach to statistics where inference methods, or models, are viewed as forecasting systems, and their quality is judged solely by the observed success of the forecasts they make. Observations on Prequential Analysis Jukka En 2006-12-16T15:35:13-00:00 aixi gales prediction prequential statistics survivability http://www.citeulike.org/user/scis0000001/article/1198001 <i>(1996)</i> Universal data compression and portfolio selection TM Cover (1996) 2007-03-30T13:42:08-00:00 1996 0272-5428 IEEE Computer Society aixi algorithmic-information-theory computational-economics computational-epistemology duality investment-theory portfolio-selection