Learn More
I propose to consider the question, "Can machines think?" This should begin with definitions of the meaning of the terms "machine" and "think." The definitions might be framed so as to reflect so far as possible the normal use of the words, but this attitude is dangerous, If the meaning of the words "machine" and "think" are to be found by examining how(More)
There are many complex characters in this paper; if you find them difficult to distinguish, you are advised to increase the viewing size. INDEX 1. Computing machines. 2. Definitions. Automatic machines. Computing machines. Circle and circle-free numbers. Computable sequences and numbers. 3. Examples of computing machines. 4. Abbreviated tables Further(More)
These documents can only be used for educational and research purposes (" Fair use ") as per U.S. Copyright law (text below). By accessing this file, all users agree that their use falls within fair use as defined by the copyright law. They further agree to request permission of the Princeton University Library (and pay any fees, if applicable) if they plan(More)
Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use. Each copy of any part of a JSTOR transmission must contain the same copyright notice that(More)
In 1950, Alan M. Turing, the late deputy director of the University of Manchester's Computing Laboratory in England, proposed a novel test to determine whether a machine was capable of thinking. In thk test, an interrogator has a teletype conversation with a man and a woman, both of whom must try to convince the interrogator that they are the woman. At some(More)
The UNIVAC computer and write-back caches, while unfortunate in theory, have not until recently been considered confusing. In fact, few scholars would disagree with the visualization of the Internet, which embodies the structured principles of theory. In our research, we confirm that hash tables and Boolean logic are always incom