Isbn: 9786132714329 - ai-complete: artificial intelligence, strong ai, np-complete, np-hard, computational complexity theory, eric s. raymond, jargon file, eliza (3 Ergebnisse)

Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware 124 pp. Englisch.

Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In the field ofartificial intelligence, the most difficult problems are informallyknown as AI-complete or AI-hard, implying that the difficulty of thesecomputational problems is equivalent to solving the central artificialintelligence problem-making computers as intelligent as people, orstrong AI. The term was coined by Fanya Montalvo by analogy withNP-complete and NP-hard in complexity theory, which formally describesthe most famous class of difficult problems. Early uses of the term arein Erik Mueller's 1987 Ph.D. dissertation and in Eric Raymond's 1991Jargon File.…

Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In the field ofartificial intelligence, the most difficult problems are informallyknown as AI-complete or AI-hard, implying that the difficulty of thesecomputational problems is equivalent to solving the central artificialintelligence problem-making computers as intelligent as people, orstrong AI. The term was coined by Fanya Montalvo by analogy withNP-complete and NP-hard in complexity theory, which formally describesthe most famous class of difficult problems. Early uses of the term arein Erik Mueller's 1987 Ph.D. dissertation and in Eric Raymond's 1991Jargon File.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 124 pp. Englisch.…