“In 1936 the notion of a computable function was clarified by Turing, and he showed the existence of universal computers that, with an appropriate program, could compute anything computed by any other computer. […] In some subconscious sense even the sales departments of computer manufacturers are aware of this, and they do not advertise magic instructions that cannot be simulated on competitors machines, but only that their machines are faster, cheaper, have more memory, or are easier to program.”

" Towards a Mathematical Science of Computation http://www-formal.stanford.edu/jmc/towards.html", Information Processing 1962: Proceedings of IFIP Congress 62, ed. Cicely M. Popplewell (Amsterdam, 1963), pp. 21–28
1960s

Adopted from Wikiquote. Last update June 3, 2021. History

Help us to complete the source, original and additional information

Do you have more details about the quote "In 1936 the notion of a computable function was clarified by Turing, and he showed the existence of universal computers…" by John McCarthy?
John McCarthy photo
John McCarthy 12
American computer scientist and cognitive scientist 1927–2011

Related quotes

Alan Cox photo

“A Computer is a state machine. Threads are for people who can't program state machines.”

Alan Cox (1968) British computer programmer

Re: Alan Cox quote? (was: Re: accounting for threads) http://www.uwsg.indiana.edu/hypermail/linux/kernel/0106.2/0405.html.

Seymour Papert photo

“Should the computer program the kid or should the kid program the computer?”

Seymour Papert (1928–2016) MIT mathematician, computer scientist, and educator

Spacewar http://wheels.org/spacewar/stone/rolling_stone.html ROLLING STONE · 7 DECEMBER 1972

Daniel Abraham photo

“Computers, it seemed, could be programmed to do almost anything but sense when someone was up to no good.”

Daniel Abraham (1969) speculative fiction writer from the United States

Source: Nemesis Games (2015), Chapter 7 (p. 76)

“A computer that issues a rate demand for nil dollars and nil cents (and a notice to appear in court if you do not pay immediately) is not a maverick machine. It is a respectable and badly programmed computer… Mavericks are machines that embody theoretical principles or technical inventions which deviate from the mainstream of computer development, but are nevertheless of value.”

Gordon Pask (1928–1996) British psychologist

Source: Microman: Computers and the Evolution of Consciousness (1982), p. 133 as cited in: Jon Bird and Ezequiel Di Paolo (2008) " Gordon Pask and His Maverick Machines http://www.sussex.ac.uk/Users/ezequiel/Husbands_08_Ch08_185-212.pdf", In: The Mechanical Mind in History, 2008.

Edsger W. Dijkstra photo

“When we had no computers, we had no programming problem either. When we had a few computers, we had a mild programming problem. Confronted with machines a million times as powerful, we are faced with a gigantic programming problem.”

Edsger W. Dijkstra (1930–2002) Dutch computer scientist

Dijkstra (1986) Visuals for BP's Venture Research Conference http://www.cs.utexas.edu/users/EWD/transcriptions/EWD09xx/EWD963.html (EWD 963).
1980s

John Rogers Searle photo
J. C. R. Licklider photo

“Present-day computers are designed primarily to solve preformulated problems or to process data according to predetermined procedures. The course of the computation may be conditional upon results obtained during the computation, but all the alternatives must be foreseen in advance. … The requirement for preformulation or predetermination is sometimes no great disadvantage. It is often said that programming for a computing machine forces one to think clearly, that it disciplines the thought process. If the user can think his problem through in advance, symbiotic association with a computing machine is not necessary.
However, many problems that can be thought through in advance are very difficult to think through in advance. They would be easier to solve, and they could be solved faster, through an intuitively guided trial-and-error procedure in which the computer cooperated, turning up flaws in the reasoning or revealing unexpected turns in the solution. Other problems simply cannot be formulated without computing-machine aid. … One of the main aims of man-computer symbiosis is to bring the computing machine effectively into the formulative parts of technical problems.
The other main aim is closely related. It is to bring computing machines effectively into processes of thinking that must go on in "real time," time that moves too fast to permit using computers in conventional ways. Imagine trying, for example, to direct a battle with the aid of a computer on such a schedule as this. You formulate your problem today. Tomorrow you spend with a programmer. Next week the computer devotes 5 minutes to assembling your program and 47 seconds to calculating the answer to your problem. You get a sheet of paper 20 feet long, full of numbers that, instead of providing a final solution, only suggest a tactic that should be explored by simulation. Obviously, the battle would be over before the second step in its planning was begun. To think in interaction with a computer in the same way that you think with a colleague whose competence supplements your own will require much tighter coupling between man and machine than is suggested by the example and than is possible today.”

Man-Computer Symbiosis, 1960

Seymour Papert photo
Alan Turing photo

Related topics