Not enough data to create a plot.
Try a different view from the menu above.
Presentation of a Maze-Solving Machine
The maze can be changed _ any desired mantler by rearranging the partitions between the twen --:five squares. In the maze there is a sensing finger, which can feel the -.:titions of the maze as it comes against them. This finger is moved .- The goal is mounted on a pin which can be slipped into a jack _ any of the twenty-five squares. Thus you can change the problem ..' way you choose, within the limits of the 5 x 5 maze.
Investigations on Synaptic Transmission
' This work was done in collaboration with Drs. But it is attenuated because the electrode computes a weighted average over a volume of a function whose own average is zero. To this external medium, the nerve appears to produce, absorb, then produce current when a spike passes; from this probe's standpoint of view, the impulse is a source, followed by sink, followed by source. Their algebraic sum in time is zero, unless the impulse stops either at the electrode or short of it. In the former case, the preceding source is averaged with the initial part of the sink, but the stationary decaying sink is recorded as a large negative potential with respect to a remote electrode.
Prediction and Entropy of Printed English
The entropy is a statistical parameter which measures, in a certain sense, how much information is produced on the average for each letter of a text in the language. If the language is translated into binary digits (0 or 1) in the most efficient way, the entropy // is the average number of binary digits required per letter of the original language. The redundancy, on the other hand, measures the amount of constraint imposed on a text in the language due to its statistical structure, e.g., in English the high frequency of the letter £, the strong tendency of H to follow T or of V to follow Q. It was estimated that when statistical effects extending over not more than eight letters are considered the entropy is roughly 2.3 bits per letter, the redundancy about 50 per cent. Since then a new method has been found for estimating these quantities, which is more sensitive and takes account of long range statistics, influences extending over phrases, sentences, etc.
A machine that learns
It was named M achina speculatrix. "conditioned reflexes" brought the study The conditioned, 01' neutral, stimulus to which In M spheri-latrix we had:1 reflex. MACHINA SPECULATRIX, photographed by time cx-POSUI'E, is attracted by light in hutch at right. CONDITIONED REFLEX requires this arrangement of nerve cells. With this arrangement the model is reasonably docile.
Computing machinery and intelligence
An excellent place to start. In this article, Turing not only proposes the Imitation Game in its original form, but addresses nine different arguments against AI, including Goedel's theorem and consciousness. Several recent arguments against AI are variations on the ones Turing enumerates. '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....The new form of the problem can be described in terms of a game which we call the "imitation game."' I.—COMPUTING MACHINERY AND INTELLIGENCE. Mind 59, p. 433-460 (PDF from Oxford University Press).