Alan Turing quote: “If an ɑ-machine prints two kinds of symbols, of which the first kind (called figures) consists entirely of 0 and 1 (the…”

“The machine is supplied with a "tape" (the analogue of paper) running through it, and divided into sections (called "squares") each capable of bearing a "symbol."”

Alan Turing Computable Numbers

On Computable Numbers, with an Application to the Entscheidungsproblem (1936)

“I am not some kind of computer. Only machines have glib answers for everything.”

Madeleine L'Engle A Swiftly Tilting Planet

Source: A Swiftly Tilting Planet

“The "scanned symbol" is the only one of which the machine is... "directly aware."”

Alan Turing Computable Numbers

However, by altering its m-configuration the machine can effectively remember some of the symbols which it has "seen" (scanned) previously.
On Computable Numbers, with an Application to the Entscheidungsproblem (1936)

“In some of the configurations in which the scanned square is blank... the machine writes down a new symbol on the scanned square: in other configurations it erases the scanned symbol.”

Alan Turing Computable Numbers

On Computable Numbers, with an Application to the Entscheidungsproblem (1936)

“When taken as a way of modeling cognitive architecture, connectionism really does represent an approach that is quite different from that of the classical cognitive science that it seeks to replace. Classical models of the mind were derived from the structure of Turing and Von Neumann machines. They are not, of course, committed to the details of these machines as exemplified in Turing's original formulation or in typical commercial computers—only to the basic idea that the kind of computing that is relevant to understanding cognition involves operations on symbols.. In contrast, connectionists propose to design systems that can exhibit intelligent behavior without storing, retrieving, or otherwise operating on structured symbolic expressions. The style of processing carried out in such models is thus strikingly unlike what goes on when conventional machines are computing some function.”

Jerry Fodor (1935–2017) American philosopher

Jerry A. Fodor, and Zenon W. Pylyshyn. "Connectionism and cognitive architecture: A critical analysis." Cognition 28.1-2 (1988): 3-71.

“When taken as a way of modeling cognitive architecture, connectionism really does represent an approach that is quite different from that of the classical cognitive science that it seeks to replace. Classical models of the mind were derived from the structure of Turing and Von Neumann machines. They are not, of course, committed to the details of these machines as exemplified in Turing's original formulation or in typical commercial computers—only to the basic idea that the kind of computing that is relevant to understanding cognition involves operations on symbols.. In contrast, connectionists propose to design systems that can exhibit intelligent behavior without storing, retrieving, or otherwise operating on structured symbolic expressions. The style of processing carried out in such models is thus strikingly unlike what goes on when conventional machines are computing some function.”

Zenon Pylyshyn (1937) Canadian philosopher

Jerry A. Fodor, and Zenon W. Pylyshyn. "Connectionism and cognitive architecture: A critical analysis." Cognition 28.1-2 (1988): 3-71.

“It is at work everywhere, functioning smoothly at times, at other times in firs and starts. It breathes, it heats, it eats. It shits and fucks. What a mistake to have ever said the id. Everywhere it is machines- real ones, not figurative ones: machines driving other machines, machines being driven by other machines, with all the necessary couplings and connections. An organ-machine is plugged into an energy-source-machine: the one produces a flow that the other interrupts The breast is a machine that produces miilk, and the mouth a machine coupled to it.”

Gilles Deleuze (1925–1995) French philosopher

The Desiring Machine
Anti-Oedipus Capitalism and Schizophrenia (1977)

“We may compare a man in the process of computing a real number to a machine which is only capable of a finite number of conditions q1, q2, ..., qK which will be called " m-configurations ."”

Alan Turing Computable Numbers

On Computable Numbers, with an Application to the Entscheidungsproblem (1936)

“It is at work everywhere, functioning smoothly at times, at other times in fits and starts. It breathes, it heats, it eats. It shits and fucks. What a mistake to have ever said the id. Everywhere it is machines — real ones, not figurative ones: machines driving other machines, machines being driven by other machines, with all the necessary couplings and connections.”

Gilles Deleuze (1925–1995) French philosopher

from Anti-oedipus: capitalism and schizophrenia, p. 1

“It seems to me that the notion of machine that was current in the course of the Industrial Revolution – and which we might have inherited – is a notion, essentially, of a machine without goal, it had no goal ‘of’, it had a goal ‘for’. And this gradually developed into the notion of machines with goals ‘of’, like thermostats, which I might begin to object to because they might compete with me. Now we’ve got the notion of a machine with an underspecified goal, the system that evolves. This is a new notion, nothing like the notion of machines that was current in the Industrial Revolution, absolutely nothing like it. It is, if you like, a much more biological notion, maybe I’m wrong to call such a thing a machine; I gave that label to it because I like to realise things as artifacts, but you might not call the system a machine, you might call it something else.”

Gordon Pask (1928–1996) British psychologist

Pask (1972) in: Mary Catherine Bateson Our Own Metaphor: A Personal Account of a Conference on the Effects of Conscious Purpose on Human Adaptation. New York : Alfred A Knopf. Quotes in: Usman Haque (2007) " The Architectural Relevance of Gordon Pask http://www.haque.co.uk/papers/architectural_relevance_of_gordon_pask.pdf" in: Architectural Design. Vol 77, Issue 4, p. 54.

“If an ɑ-machine prints two kinds of symbols, of which the first kind (called figures) consists entirely of 0 and 1 (the others being called symbols of the second kind), then the machine will be called a computing machine.”

Help us to complete the source, original and additional information

Alan Turing 33

Related quotes

Related topics