Universal Artificial Intelligence: Sequential Decisions Based on Algorithmic ProbabilitySpringer Science & Business Media, 12 okt 2004 - 278 pagina's Personal motivation. The dream of creating artificial devices that reach or outperform human inteUigence is an old one. It is also one of the dreams of my youth, which have never left me. What makes this challenge so interesting? A solution would have enormous implications on our society, and there are reasons to believe that the AI problem can be solved in my expected lifetime. So, it's worth sticking to it for a lifetime, even if it takes 30 years or so to reap the benefits. The AI problem. The science of artificial intelligence (AI) may be defined as the construction of intelligent systems and their analysis. A natural definition of a system is anything that has an input and an output stream. Intelligence is more complicated. It can have many faces like creativity, solving prob lems, pattern recognition, classification, learning, induction, deduction, build ing analogies, optimization, surviving in an environment, language processing, and knowledge. A formal definition incorporating every aspect of intelligence, however, seems difficult. Most, if not all known facets of intelligence can be formulated as goal driven or, more precisely, as maximizing some utility func tion. It is, therefore, sufficient to study goal-driven AI; e. g. the (biological) goal of animals and humans is to survive and spread. The goal of AI systems should be to be useful to humans. |
Overige edities - Alles bekijken
Universal Artificial Intelligence: Sequential Decisions Based on Algorithmic ... Marcus Hutter Gedeeltelijke weergave - 2005 |
Universal Artificial Intelligence: Sequential Decisions Based on Algorithmic ... Marcus Hutter Geen voorbeeld beschikbaar - 2009 |
Universal Artificial Intelligence: Sequential Decisions Based on Algorithmic ... Marcus Hutter Geen voorbeeld beschikbaar - 2004 |
Veelvoorkomende woorden en zinsdelen
action agent AIXI model AIXIt AIµ algorithmic information theory approximable arg max assume assumption asymptotically axioms Bayes mixtures binary chain rule chronological semimeasure constant convergence countable cycle decision theory defined definition depends deterministic discount entropy enumerable semimeasures environment ergodic MDPS error bounds exists finitely computable formal hence horizon implies induction inequality infinite information theory input Kolmogorov complexity ky ky Lemma length Levin search loss bounds loss functions machine learning mathematical maximize measure minimization Msemi Occam's razor optimal policy output Pareto optimality prediction scheme predictor prior probability probabilistic probability distribution probability theory problem classes proof prove recursive reinforcement learning Section self-optimizing policies semi sense sequence prediction sequential decision theory shortest Solomonoff's solve string supervised learning Theorem true universal prior universal Turing machine weights YES YES YES Ук