Yahoo Search Búsqueda en la Web

Resultado de búsqueda

  1. Perceptrons: an introduction to computational geometry is a book written by Marvin Minsky and Seymour Papert and published in 1969. An edition with handwritten corrections and additions was released in the early 1970s.

    • Marvin Lee Minsky, Seymour Papert
    • 1969
  2. Perceptrons—the first systematic study of parallelism in computationmarked a historic turn in artificial intelligence, returning to the idea that intelligence might emerge from the activity of networks of neuron-like entities.

  3. 21 de may. de 2012 · Perceptrons : an introduction to computational geometry. by. Minsky, Marvin Lee, 1927-; Papert, Seymour. Publication date. 1988. Topics. Perceptrons, Geometry, Parallel processing (Electronic computers), Machine learning. Publisher. Cambridge, Mass. : MIT Press.

  4. Perceptrons. An Introduction to Computational Geometry. by Marvin Minsky and Seymour A. Papert. Paperback. $10.95. Paperback. ISBN: 9780262630221. Pub date: January 15, 1969. Publisher: The MIT Press. 258 pp., MIT Press Bookstore Penguin Random House Amazon Barnes and Noble Bookshop.org Indiebound Indigo Books a Million. Hardcover. Description.

  5. 28 de dic. de 1987 · Perceptrons - the first systematic study of parallelism in computation - has remained a classical work on threshold automata networks for nearly two decades. It marked a historical turn in artificial intelligence, and it is required reading for anyone who wants to understand the connectionist counterrevolution that is going on today.

    • (17)
    • 1969
    • Marvin Lee Minsky, Seymour Papert
    • Marvin Minsky, Seymour A. Papert
  6. Perceptrons -- the first systematic study of parallelism in computation -- has remained a classical work on threshold automata networks for nearly two decades.

  7. Perceptrons: An Introduction to Computational Geometry, Expanded Edition. Expanded, Subsequent Edición. Perceptrons - the first systematic study of parallelism in computation - has remained a classical work on threshold automata networks for nearly two decades.

    • (16)