Multivac Multivac

Multivac - Definition and Overview

Multivac is the name of a fictional computer in many stories by Isaac Asimov. According to his autobiography In Memory Yet Green, Asimov coined the name in imitation of UNIVAC, the early mainframe computer. While he initially intended the name to stand for "Multiple vacuum tubes", his later story "The Last Question" expands the -ac suffix as "analog computer".

Like most of the technologies Asimov describes in his fiction, Multivac's exact specifications vary among appearances. In all cases, it is a government-run computer, buried deep underground for security purposes; however, Asimov never settles on a particular size for the computer or the supporting facilities around it. Unlike the artificial intelligences portrayed in his Robot Series, Multivac's interface is mechanized and impersonal, consisting of complex command consoles few humans can operate. In the first Multivac story, "Franchise", Multivac chooses a single "most representative" person from the population of the United States, whom the computer then interrogates to determine the country's overall orientation. All elected offices are then filled by the candidates the computer deems acceptable to the populace. Asimov wrote this story as the logical culmination—or possibly the reductio ad absurdum—of UNIVAC's ability to forecast election results from small samples.

In possibly the most famous Multivac story, "The Last Question", two slightly drunken technicians ask Multivac if humanity can reverse the increase of entropy. Multivac fails, displaying the error message "INSUFFICIENT DATA FOR MEANINGFUL ANSWER". The story continues through many iterations of computer technology, each more powerful and ethereal than the last: Microvac, Galactic AC, Universal AC, and finally Cosmic AC. Each of these computers is asked the question, and each returns the same indecisive response, until the heat death of the Universe makes all life impossible.

Copyright 2009 WordIQ.com - Privacy Policy  :: Terms of Use  :: Contact Us  :: About Us
This article is licensed under the GNU Free Documentation License. It uses material from the this Wikipedia article.