en
Philip C.Jackson

Introduction to Artificial Intelligence

Giv mig besked når bogen er tilgængelig
Denne bog er ikke tilgængelig i streaming pt. men du kan uploade din egen epub- eller fb2-fil og læse den sammen med dine andre bøger på Bookmate. Hvordan overfører jeg en bog?
Can computers think? Can they use reason to develop their own concepts, solve complex problems, understand our languages? This updated edition of a comprehensive survey includes extensive new text on "Artificial Intelligence in the 21st Century," introducing deep neural networks, conceptual graphs, languages of thought, mental models, metacognition, economic prospects, and research toward human-level AI.
Ideal for both lay readers and students of computer science, the original text features abundant illustrations, diagrams, and photographs as well as challenging exercises. Lucid, easy-to-read discussions examine problem-solving methods and representations, game playing, automated understanding of natural languages, heuristic search theory, robot systems, heuristic scene analysis, predicate-calculus theorem proving, automatic programming, and many other topics.
Denne bog er ikke tilgængelig i øjeblikket
958 trykte sider
Udgivelsesår
2019
Har du allerede læst den? Hvad synes du om den?
👍👎

Citater

  • Medionhar citeretfor 3 år siden
    A universal Turing machine, then, is one that can be "given a program" that enables it to simulate a Turing machine: In fact, a universal Tm is theoretically equivalent to a general-purpose, discrete (or digital) computer, and the program one gives a digital computer is analogous to a descriptive string dT for some Turing machine T.
  • Medionhar citeretfor 3 år siden
    only essential difference between Turing machines and finite-state automata lies in the fact that a Turing machine is able to store its output on a potentially infinite tape and refer to it later
  • Medionhar citeretfor 3 år siden
    In fact, finite-state machines are only the building blocks of automata theory; they represent the simplest type of machine, one in which the future of an occurrence can depend on only a finite number of different "past histories," or states.
fb2epub
Træk og slip dine filer (ikke mere end 5 ad gangen)